A representative set technique produces a deterministic O*(6.855^t)-time algorithm for the kidney exchange problem with length-bounded cycles and chains.
Glorie, Joris van de Klun- dert, and Albert P
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
A representative set technique produces a deterministic O*(6.855^t)-time algorithm for the kidney exchange problem with length-bounded cycles and chains.