A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs

Amariah Becker, Philip N. Klein, David Saulpic. A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. In Kirk Pruhs, Christian Sohler, editors, 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria. Volume 87 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

Authors

Amariah Becker

This author has not been identified. Look up 'Amariah Becker' in Google

Philip N. Klein

This author has not been identified. Look up 'Philip N. Klein' in Google

David Saulpic

This author has not been identified. Look up 'David Saulpic' in Google