Sharath Raghvendra. Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line. In Bettina Speckmann, Csaba D. Tóth, editors, 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary. Volume 99 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{Raghvendra18,
title = {Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line},
author = {Sharath Raghvendra},
year = {2018},
doi = {10.4230/LIPIcs.SoCG.2018.67},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.67},
researchr = {https://researchr.org/publication/Raghvendra18},
cites = {0},
citedby = {0},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary},
editor = {Bettina Speckmann and Csaba D. Tóth},
volume = {99},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-066-8},
}