Parameterized complexity of the k-arc Chinese postman problem
From MaRDI portal
(Redirected from Publication:340562)
Parameterized complexity of the \(k\)-arc Chinese postman problem
Parameterized complexity of the \(k\)-arc Chinese postman problem
Recommendations
- Parameterized Complexity of the k-Arc Chinese Postman Problem
- Parameterized complexity of \(k\)-Chinese postman problem
- Parameterized directed \(k\)-Chinese postman problem and \(k\) arc-disjoint cycles problem on Euler digraphs
- The mixed Chinese postman problem parameterized by pathwidth and treedepth
- Structural parameterizations of the mixed Chinese postman problem
- A Note on K-Best Solutions to the Chinese Postman Problem
- Approximation algorithms for solving the heterogeneous Chinese postman problem
- An approximation algorithm for solving the heterogeneous Chinese postman problem
- Approximation algorithms for a mixed postman problem with restrictions on the arcs
- An algorithm for the hierarchical Chinese postman problem
Cites work
- scientific article; zbMATH DE number 3724496 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Arc Routing
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Digraphs
- Finding small separators in linear time via treewidth reduction
- Fundamentals of parameterized complexity
- Matching, Euler tours and the Chinese postman
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- Networks and vehicle routing for municipal waste collection
- On the complexity of edge traversing
- Parametrized complexity theory.
- The Chinese Postman Problem for Mixed Networks
- Treewidth. Computations and approximations
Cited in
(13)- Parameterized complexity of \(k\)-Chinese postman problem
- The parameterized complexity of the minimum shared edges problem
- The mixed Chinese postman problem parameterized by pathwidth and treedepth
- An updated annotated bibliography on arc routing problems
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Parameterized directed \(k\)-Chinese postman problem and \(k\) arc-disjoint cycles problem on Euler digraphs
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Structural parameterizations of the mixed Chinese postman problem
- Parameterized Complexity of the k-Arc Chinese Postman Problem
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
- Approximation algorithms for some minimum postmen cover problems
- Postman problems on series-parallel mixed graphs
This page was built for publication: Parameterized complexity of the \(k\)-arc Chinese postman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340562)
