Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802): Difference between revisions

@@ Property / cites work @@
+Approximations for minimum and min-max vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+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 @@
+Approximation Algorithms for Min–Max Tree Partition
+Normal rank
@@ Property / cites work @@
+Approximating the \(k\)-traveling repairman problem with repair times
+Normal rank
@@ Property / cites work @@
+On the Distance Constrained Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for distance constrained vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
+Normal rank
@@ Property / cites work @@
+Approximation hardness of min-max tree covers
@@ Property / cites work: Approximation hardness of min-max tree covers / rank @@
+Normal rank