Pages that link to "Item:Q1785236"
From MaRDI portal
The following pages link to Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236):
Displaying 8 items.
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- Approximation algorithms with constant factors for a series of asymmetric routing problems (Q6194441) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
