Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683): Difference between revisions

@@ Property / cites work @@
+New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for deadline-TSP and vehicle routing with time-windows
+Normal rank
@@ Property / cites work @@
+On approximating a geometric prize-collecting traveling salesman problem with time windows
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Orienteering and Discounted-Reward TSP
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q3579451
@@ Property / cites work: Q3579451 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3601545
@@ Property / cites work: Q3601545 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding relaxations in global constraints for solving TSP and TSPTW
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows
+Normal rank
@@ Property / cites work @@
+Analysis of Christofides' heuristic: some paths are more difficult than cycles
+Normal rank
@@ Property / cites work @@
+Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
+Normal rank
@@ Property / cites work @@
+Q5585021
@@ Property / cites work: Q5585021 / rank @@
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+Special cases of traveling salesman and repairman problems with time windows
+Normal rank