An approximate König's theorem for edge-coloring weighted bipartite graphs
From MaRDI portal
Publication:3581002
DOI10.1145/1007352.1007417zbMath1192.05046OpenAlexW1995055095MaRDI QIDQ3581002
José R. Correa, Michel X. Goemans
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007417
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of packing and covering (05B40)
Related Items (1)
This page was built for publication: An approximate König's theorem for edge-coloring weighted bipartite graphs
