Node-Balancing by Edge-Increments

DOI10.1007/978-3-662-48350-3_38zbMath1466.68057arXiv1504.06919OpenAlexW1934654566MaRDI QIDQ3452807

Friedrich Eisenbrand, Martin Skutella, Shay Moran, Rom Pinchasi

Publication date: 19 November 2015

Published in: Algorithms - ESA 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06919

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial algorithm for b-matchings: An alternative approach
• Regularisable graphs I
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Finding minimum-cost circulations by canceling negative cycles
• Combinatorial Optimization with Rational Objective Functions
• Faster scaling algorithms for general graph matching problems
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• The Factors of Graphs