Approximation algorithms for some min-max postmen cover problems (Q2241210): Difference between revisions

@@ Property / DOI @@
-.1007/s10479-021-03933-4
@@ Property / DOI: 10.1007/s10479-021-03933-4 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10479-021-03933-4
+Normal rank
@@ Property / OpenAlex ID @@
+W3135507527
@@ Property / OpenAlex ID: W3135507527 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for minimum and min-max vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Arc Routing
@@ Property / cites work: Arc Routing / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Matching, Euler tours and the Chinese postman
@@ Property / cites work: Matching, Euler tours and the Chinese postman / rank @@
+Normal rank
@@ Property / cites work @@
+Arc Routing Problems, Part II: The Rural Postman Problem
+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 Some Postman Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5519709
@@ Property / cites work: Q5519709 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of \(k\)-Chinese postman problem
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for TSP in the half integral case
+Normal rank
@@ Property / cites work @@
+New inapproximability bounds for TSP
@@ Property / cites work: New inapproximability bounds for TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms
@@ Property / cites work: Combinatorial optimization. Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Solvable cases of the \(k\)-person Chinese postman problem
+Normal rank
@@ Property / cites work @@
+Q3931037
@@ Property / cites work: Q3931037 / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-factor approximations for capacitated arc routing without triangle inequality
+Normal rank
@@ Property / cites work @@
+Q5271449
@@ Property / cites work: Q5271449 / rank @@
+Normal rank
@@ Property / cites work @@
+A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
+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 / cites work @@
+Better approximability results for min-max tree/cycle/path cover problems
+Normal rank
@@ Property / DOI @@
+.1007/S10479-021-03933-4
@@ Property / DOI: 10.1007/S10479-021-03933-4 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2241210