Pages that link to "Item:Q517802"
From MaRDI portal
The following pages link to Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802):
Displaying 26 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Approximation hardness of min-max tree covers (Q974986) (← links)
- Min-max cover of a graph with a small number of parts (Q1751107) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← 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)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Approximation Algorithms for Generalized Bounded Tree Cover (Q2803829) (← links)
- Generalized Bounded Tree Cover of a Graph (Q2971394) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency (Q3381954) (← links)
- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (Q3613779) (← links)
- Algorithms and Computation (Q5191683) (← links)
- Algorithms and Computation (Q5712159) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- New approximation algorithms for the minimum cycle cover problem (Q5919633) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
- (Q6084420) (← links)
- Induced tree covering and the generalized Yutsis property (Q6547951) (← links)
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems (Q6646740) (← links)
