New and simple algorithms for stable flow problems
DOI10.1007/978-3-319-68705-6_16zbMath1426.91171arXiv1309.3701OpenAlexW2963223359WikidataQ128627566 ScholiaQ128627566MaRDI QIDQ5915793
Publication date: 4 January 2018
Published in: Algorithmica, Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.3701
polynomial algorithmmulticommodity flowsstable matchingsrestricted edgesstable allocation problemstable flows\(\mathsf{NP}\)-completeness
Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on kernels and Sperner's Lemma
- Efficient algorithms for generalized stable marriage and roommates problems
- Some remarks on the stable matching problem
- A new fixed point approach for stable networks and stable marriages
- A tale of two mechanisms: Student placement
- Network flow and 2-satisfiability
- On the complexity of the parity argument and other inefficient proofs of existence
- On the stable \(b\)-matching polytope.
- The stable marriage problem with restricted pairs.
- The stable fixtures problem with payments
- Stable multicommodity flows
- Stable flows over time
- On stable matchings and flows
- Stable marriage and roommates problems with restricted edges: complexity and approximability
- Faster algorithms for stable allocation problems
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Trading Networks With Frictions
- College Admissions and the Stability of Marriage
This page was built for publication: New and simple algorithms for stable flow problems
