Randomized parameterized algorithms for the kidney exchange problem
DOI10.3390/a12020050zbMath1461.90122OpenAlexW2916243136WikidataQ128320771 ScholiaQ128320771MaRDI QIDQ2632525
Jianxin Wang, Qilong Feng, Mugang Lin, Bin Fu
Publication date: 14 May 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a12020050
randomized algorithmparameterized algorithmkidney exchange problemmultilinear monomial detectionrandom partitioning
Analysis of algorithms and problem complexity (68Q25) Stochastic programming (90C15) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Faster algorithms for finding and counting subgraphs
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- The kidney exchange problem: how hard is it to find a donor?
- Three-sided stable matchings with cyclic preferences
- Circular stable matching and 3-way kidney transplant
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
- New insights on integer-programming models for the kidney exchange problem
- Narrow sieves for parameterized paths and packings
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Kidney Exchange
- Iterative Expansion and Color Coding
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets
- Decomposition Principle for Linear Programs
- Randomized Assignments for Barter Exchanges: Fairness vs. Efficiency
- Faster Algebraic Algorithms for Path and Packing Problems
- Approximating Matches Made in Heaven
- Limits and Applications of Group Algebras for Parameterized Problems
- MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS
- Determinant Sums for Undirected Hamiltonicity
- Parameterized Algorithms
- Maximum matching and a polyhedron with 0,1-vertices
- Depth-First Search and Linear Graph Algorithms
- Hardness results for stable exchange problems
This page was built for publication: Randomized parameterized algorithms for the kidney exchange problem
