The following pages link to Algorithms and Computation (Q5191642):
Displaying 11 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Approximation hardness of min-max tree covers (Q974986) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
- Approximating the minmax rooted-tree cover in a tree (Q2380018) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- (Q5881545) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
