Author of the publication

Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs.

, , , and . SEA, volume 75 of LIPIcs, page 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The gameability of redistricting criteria., and . J. Comput. Soc. Sci., 5 (2): 1735-1777 (November 2022)A PTAS for Minimum Makespan Vehicle Routing in Trees., and . CoRR, (2018)PyEI: A Python package for ecological inference., , and . J. Open Source Softw., 6 (64): 3397 (2021)A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs., , and . ESA, volume 87 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Capacitated Domination Problems on Planar Graphs.. WAOA, volume 10787 of Lecture Notes in Computer Science, page 1-16. Springer, (2017)Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Metrics with Bounded Highway Dimension., , and . CoRR, (2017)A Framework for Vehicle Routing Approximation Schemes in Trees., and . WADS, volume 11646 of Lecture Notes in Computer Science, page 112-125. Springer, (2019)Redistricting Algorithms., and . CoRR, (2020)Capacitated Dominating Set on Planar Graphs.. CoRR, (2016)Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs., , , and . SEA, volume 75 of LIPIcs, page 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)