A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs

DOI10.1137/1.9781611975482.36zbMath1431.68096arXiv1807.04802OpenAlexW2883037415MaRDI QIDQ5236217

Sharath Raghvendra, Nathaniel Adam Lahn

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) 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)

Related Items (2)

Unnamed Item ⋮ Min-Cost Flow in Unit-Capacity Planar Graphs

This page was built for publication: A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs