Pages that link to "Item:Q314816"
From MaRDI portal
The following pages link to Rural postman parameterized by the number of components of required edges (Q314816):
Displaying 13 items.
- Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- An algorithm for the Rural Postman problem on a directed graph (Q3730368) (← links)
- Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks (Q5056047) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
