Approximation algorithms for some minimum postmen cover problems (Q5918771): Difference between revisions

@@ Property / Wikidata QID @@
+Q114191469
@@ Property / Wikidata QID: Q114191469 / 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.dam.2022.01.005
+Normal rank
@@ Property / OpenAlex ID @@
+W4226003954
@@ Property / OpenAlex ID: W4226003954 / rank @@
+Normal rank
@@ Property / cites work @@
+The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
+Normal rank
@@ Property / cites work @@
+Approximations for minimum and min-max vehicle routing problems
+Normal rank
@@ Property / cites work @@
+The periodic rural postman problem with irregular services on mixed graphs
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the minimum 3-path partition problem
+Normal rank
@@ Property / cites work @@
+Data mule scheduling on a path with handling time and time span constraints
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Arc Routing Problems, Part II: The Rural Postman 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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of the \(k\)-arc Chinese postman problem
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of \(k\)-Chinese postman problem
+Normal rank
@@ Property / cites work @@
+Heuristics for the rural postman problem
@@ Property / cites work: Heuristics for the rural postman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of the minimum-weight \(k\)-size cycle cover problem
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms
@@ Property / cites work: Combinatorial optimization. Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for some minimum postmen cover problems
+Normal rank
@@ Property / cites work @@
+The path partition problem and related problems in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for distance constrained vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Approximation results for min-max path cover problems in vehicle routing
+Normal rank
@@ Property / cites work @@
+\(k\)-path partitions in trees
@@ Property / cites work: \(k\)-path partitions in trees / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for some min-max and minimum cycle cover problems
+Normal rank
@@ Property / cites work @@
+New approximation algorithms for the minimum cycle cover problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for some min-max postmen cover problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5918771