A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936): Difference between revisions

@@ Property / arXiv ID @@
+.1595
@@ Property / arXiv ID: 0812.1595 / rank @@
+Normal rank
@@ Property / cites work @@
+PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Approximation schemes for NP-hard geometric optimization problems: a survey
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for Minimum Latency Problems
+Normal rank
@@ Property / cites work @@
+Q4526992
@@ Property / cites work: Q4526992 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
+Normal rank
@@ Property / cites work @@
+How Long Can a Euclidean Traveling Salesman Tour Be?
+Normal rank
@@ Property / cites work @@
+Q4219046
@@ Property / cites work: Q4219046 / rank @@
+Normal rank
@@ Property / cites work @@
+The Truck Dispatching Problem
@@ Property / cites work: The Truck Dispatching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417633
@@ Property / cites work: Q5417633 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687192
@@ Property / cites work: Q5687192 / rank @@
+Normal rank
@@ Property / cites work @@
+The vehicle routing problem. Latest advances and new challenges.
+Normal rank
@@ Property / cites work @@
+Bounds and Heuristics for Capacitated Routing Problems
+Normal rank
@@ Property / cites work @@
+Q3799801
@@ Property / cites work: Q3799801 / rank @@
+Normal rank
@@ Property / cites work @@
+A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem
+Normal rank
@@ Property / cites work @@
+Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
+Normal rank
@@ Property / cites work @@
+Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
+Normal rank
@@ Property / cites work @@
+Q4542574
@@ Property / cites work: Q4542574 / rank @@
+Normal rank
@@ Property / cites work @@
+A quasi-polynomial time approximation scheme for minimum weight triangulation
+Normal rank
@@ Property / cites work @@
+Q4955264
@@ Property / cites work: Q4955264 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank