Pages that link to "Item:Q4699169"
From MaRDI portal
The following pages link to A 3/2-Approximation Algorithm for the Mixed Postman Problem (Q4699169):
Displayed 8 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs (Q2958236) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6168929) (← links)
- The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)