Min-max tree covers of graphs. (Q703232): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.orl.2003.11.010
-Normal rank
@@ Property / OpenAlex ID @@
-W1974713906
@@ Property / OpenAlex ID: W1974713906 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2003.11.010
+Normal rank
@@ Property / OpenAlex ID @@
+W1974713906
@@ Property / OpenAlex ID: W1974713906 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for minimum and min-max vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471355
@@ Property / cites work: Q4471355 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Min–Max Tree Partition
+Normal rank
@@ Property / cites work @@
+Q3799801
@@ Property / cites work: Q3799801 / rank @@
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem
@@ Property / cites work: The Vehicle Routing Problem / rank @@
+Normal rank