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

@@ Property / DOI @@
-.1016/j.tcs.2016.01.041
@@ Property / DOI: 10.1016/j.tcs.2016.01.041 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C47
@@ Property / Mathematics Subject Classification ID: 90C47 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6655869
@@ Property / zbMATH DE Number: 6655869 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+vehicle routing
@@ Property / zbMATH Keywords: vehicle routing / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cycle cover
@@ Property / zbMATH Keywords: cycle cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+traveling salesman problem
@@ Property / zbMATH Keywords: traveling salesman problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithm
@@ Property / zbMATH Keywords: approximation algorithm / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.01.041
+Normal rank
@@ Property / OpenAlex ID @@
+W2258629489
@@ Property / OpenAlex ID: W2258629489 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.1016/J.TCS.2016.01.041
@@ Property / DOI: 10.1016/J.TCS.2016.01.041 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:344767