Stable multicommodity flows

DOI10.3390/a6010161zbMath1461.91198OpenAlexW1984454127MaRDI QIDQ1736550

Júlia Pap, Tamás Király

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a6010161

zbMATH Keywords

Sperner's lemmamulticommodity flowsstable matching problemPPAD-completenessstable flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68) Flows in graphs (05C21)

Related Items (3)

On the complexity of stable hypergraph matching, stable multicommodity flow and related problems ⋮ Editorial: Special issue on matching under preferences ⋮ New and simple algorithms for stable flow problems

Cites Work

• A note on kernels and Sperner's Lemma
• Stable flows over time
• On Stable Matchings and Flows
• Reducibility among Fractional Stability Problems
• The Stable Allocation (or Ordinal Transportation) Problem

This page was built for publication: Stable multicommodity flows