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

@@ Property / DOI @@
-.1007/s00453-012-9740-5
@@ Property / DOI: 10.1007/s00453-012-9740-5 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6697324
@@ Property / zbMATH DE Number: 6697324 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+MIN-MAX tree cover
@@ Property / zbMATH Keywords: MIN-MAX tree cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bounded tree cover
@@ Property / zbMATH Keywords: bounded tree cover / 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.1007/s00453-012-9740-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2145866065
@@ Property / OpenAlex ID: W2145866065 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.1007/S00453-012-9740-5
@@ Property / DOI: 10.1007/S00453-012-9740-5 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:517802