Pages that link to "Item:Q1932348"
From MaRDI portal
The following pages link to A new view on rural postman based on Eulerian extension and matching (Q1932348):
Displaying 13 items.
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← 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)
- (Q5089171) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- Parameterized complexity of min-power asymmetric connectivity (Q5918282) (← 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)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
