Published in: LIPIcs, Volume 227, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)
Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, and Rachita Sowle. An Improved ε-Approximation Algorithm for Geometric Bipartite Matching. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 227, pp. 6:1-6:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{agarwal_et_al:LIPIcs.SWAT.2022.6, author = {Agarwal, Pankaj K. and Raghvendra, Sharath and Shirzadian, Pouyan and Sowle, Rachita}, title = {{An Improved \epsilon-Approximation Algorithm for Geometric Bipartite Matching}}, booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)}, pages = {6:1--6:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-236-5}, ISSN = {1868-8969}, year = {2022}, volume = {227}, editor = {Czumaj, Artur and Xin, Qin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.6}, URN = {urn:nbn:de:0030-drops-161660}, doi = {10.4230/LIPIcs.SWAT.2022.6}, annote = {Keywords: Euclidean bipartite matching, approximation algorithms, primal dual method} }
Published in: LIPIcs, Volume 227, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)
Sharath Raghvendra and Rachita Sowle. A Scalable Work Function Algorithm for the k-Server Problem. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 227, pp. 30:1-30:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{raghvendra_et_al:LIPIcs.SWAT.2022.30, author = {Raghvendra, Sharath and Sowle, Rachita}, title = {{A Scalable Work Function Algorithm for the k-Server Problem}}, booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)}, pages = {30:1--30:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-236-5}, ISSN = {1868-8969}, year = {2022}, volume = {227}, editor = {Czumaj, Artur and Xin, Qin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.30}, URN = {urn:nbn:de:0030-drops-161906}, doi = {10.4230/LIPIcs.SWAT.2022.30}, annote = {Keywords: k-server, Work Function Algorithm, Minimum-cost Flow} }
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} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Sharath Raghvendra. Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 67:1-67:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{raghvendra:LIPIcs.SoCG.2018.67, author = {Raghvendra, Sharath}, title = {{Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {67:1--67:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.67}, URN = {urn:nbn:de:0030-drops-87803}, doi = {10.4230/LIPIcs.SoCG.2018.67}, annote = {Keywords: Bipartite Matching, Online Algorithms, Adversarial Model, Line Metric} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Aruni Choudhary, Michael Kerber, and Sharath Raghvendra. Improved Approximate Rips Filtrations with Shifted Integer Lattices. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 28:1-28:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{choudhary_et_al:LIPIcs.ESA.2017.28, author = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharath}, title = {{Improved Approximate Rips Filtrations with Shifted Integer Lattices}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {28:1--28:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.28}, URN = {urn:nbn:de:0030-drops-78259}, doi = {10.4230/LIPIcs.ESA.2017.28}, annote = {Keywords: Persistent homology, Rips filtrations, Approximation algorithms, Topological Data Analysis} }
Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Sharath Raghvendra. A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 18:1-18:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{raghvendra:LIPIcs.APPROX-RANDOM.2016.18, author = {Raghvendra, Sharath}, title = {{A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-018-7}, ISSN = {1868-8969}, year = {2016}, volume = {60}, editor = {Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.18}, URN = {urn:nbn:de:0030-drops-66410}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.18}, annote = {Keywords: Online Algorithms, Metric Bipartite Matching} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Aruni Choudhary, Michael Kerber, and Sharath Raghvendra. Polynomial-Sized Topological Approximations Using the Permutahedron. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 31:1-31:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{choudhary_et_al:LIPIcs.SoCG.2016.31, author = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharath}, title = {{Polynomial-Sized Topological Approximations Using the Permutahedron}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.31}, URN = {urn:nbn:de:0030-drops-59236}, doi = {10.4230/LIPIcs.SoCG.2016.31}, annote = {Keywords: Persistent Homology, Topological Data Analysis, Simplicial Approximation, Permutahedron, Approximation Algorithms} }
Feedback for Dagstuhl Publishing