Rural postman parameterized by the number of components of required edges
From MaRDI portal
(Redirected from Publication:314816)
Recommendations
- scientific article; zbMATH DE number 27244
- A polyhedral approach to the rural postman problem
- An algorithm for the Rural Postman problem on a directed graph
- scientific article; zbMATH DE number 6741962
- The rural postman problem on directed, mixed, and windy graphs
- A note on the undirected rural postman problem polytope
- Algorithms for the rural postman problem
- Reoptimizing the rural postman problem
- The Rural Postman Problem on mixed graphs with turn penalties
- A branch-and-cut algorithm for the undirected rural postman problem
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 1775055 (Why is no real title available?)
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A new view on rural postman based on Eulerian extension and matching
- Abusing the Tutte matrix: an algebraic instance compression for the \(K\)-set-cycle problem
- Approximation Algorithms for Some Postman Problems
- Arc Routing Problems, Part II: The Rural Postman Problem
- Digraphs
- Efficient algorithms for Eulerian extension
- Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- From few components to an Eulerian graph by adding ARCS
- Fundamentals of parameterized complexity
- Matching is as easy as matrix inversion
- Matching theory
- Multiplying matrices faster than coppersmith-winograd
- On Eulerian extensions and their application to no-wait flowshop scheduling
- On general routing problems
- On the complexity of edge traversing
- Parametrized complexity theory.
- Powers of tensors and fast matrix multiplication
- Set partitioning via inclusion-exclusion
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Solving SCS for bounded length strings in fewer than \(2^n\) steps
- The complexity of arc routing problems
Cited in
(15)- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- Parameterized complexity of list coloring and max coloring
- A new view on rural postman based on Eulerian extension and matching
- An algorithm for the Rural Postman problem on a directed graph
- Efficient algorithms for Eulerian extension and rural Postman
- On the complexity landscape of connected \(f\)-factor problems
- 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
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Basic Terminology, Notation and Results
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
This page was built for publication: Rural postman parameterized by the number of components of required edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314816)
