Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767): Difference between revisions

@@ Property / cites work @@
+Approximations for minimum and min-max vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Multi-Vehicle Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Min-max tree covers of graphs.
@@ Property / cites work: Min-max tree covers of graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Min-max cover of a graph with a small number of parts
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
+Normal rank
@@ Property / cites work @@
+Minmax Tree Cover in the Euclidean Space
@@ Property / cites work: Minmax Tree Cover in the Euclidean Space / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minmax rooted-tree cover in a tree
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for distance constrained vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Min-Max Cycle Cover Problems
+Normal rank
@@ Property / cites work @@
+Approximation results for min-max path cover problems in vehicle routing
+Normal rank
@@ Property / cites work @@
+Approximation results for a min-max location-routing problem
+Normal rank