The following pages link to Min-max tree covers of graphs. (Q703232):
Displaying 37 items.
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring (Q281797) (← links)
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- Covering directed graphs by in-trees (Q626455) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Approximation hardness of min-max tree covers (Q974986) (← links)
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm (Q1022474) (← links)
- Multiple UAV exploration of an unknown region (Q1022476) (← links)
- Min-max cover of a graph with a small number of parts (Q1751107) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
- The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← links)
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- On optimal coverage of a tree with multiple robots (Q2184041) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Continuous graph partitioning for camera network surveillance (Q2342775) (← 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)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- Approximation Algorithms for Generalized Bounded Tree Cover (Q2803829) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- Covering Directed Graphs by In-Trees (Q3511356) (← links)
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- New approximation algorithms for the minimum cycle cover problem (Q5919633) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- (Q6084420) (← links)
- The heterogeneous rooted tree cover problem (Q6591623) (← links)
