Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Nathaniel Lahn and Sharath Raghvendra. A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 48:1-48:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{lahn_et_al:LIPIcs.SoCG.2019.48, author = {Lahn, Nathaniel and Raghvendra, Sharath}, title = {{A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {48:1--48:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.48}, URN = {urn:nbn:de:0030-drops-104528}, doi = {10.4230/LIPIcs.SoCG.2019.48}, annote = {Keywords: Bipartite matching, Bottleneck matching} }
Feedback for Dagstuhl Publishing