New approximation algorithms for the minimum cycle cover problem (Q5919633): Difference between revisions

@@ Property / cites work @@
+Approximations for minimum and min-max vehicle routing problems
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Minimum Vehicle Routing with a Common Deadline
@@ Property / cites work: Minimum Vehicle Routing with a Common Deadline / rank @@
+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
@@ Property / cites work @@
+Improved approximation algorithms for some min-max and minimum cycle cover problems
+Normal rank