Min-max tree covers of graphs.
From MaRDI portal
Recommendations
- On the minimum vertex \(k\)-path cover of trees
- Approximating the minmax rooted-tree cover in a tree
- Maximal covering tree problems
- Approximation hardness of min-max tree covers
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
- scientific article; zbMATH DE number 1788255
- Tree cover number and maximum semidefinite nullity of some graph classes
- Covering the edges of a graph by a prescribed tree with minimum overlap
- Minimal vertex covers of random trees
- On covering vertices of a graph by trees
Cites work
- scientific article; zbMATH DE number 4066603 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079396 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Approximation Algorithms for Min–Max Tree Partition
- Approximations for minimum and min-max vehicle routing problems
- The vehicle routing problem
Cited in
(48)- Approximation results for min-max path cover problems in vehicle routing
- The heterogeneous rooted tree cover problem
- An approximation algorithm for vehicle routing with compatibility constraints
- Covering directed graphs by in-trees
- Approximation algorithms for generalized bounded tree cover
- The \(m\)-Steiner traveling salesman problem with online edge blockages
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- scientific article; zbMATH DE number 7758357 (Why is no real title available?)
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem
- An overview of graph covering and partitioning
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring
- Approximation results for a min-max location-routing problem
- Minimum makespan vehicle routing problem with compatibility constraints
- Continuous graph partitioning for camera network surveillance
- Capacitated vehicle routing with non-uniform speeds
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- New LP relaxations for minimum cycle/path/tree cover problems
- Multiple UAV exploration of an unknown region
- Minmax Tree Cover in the Euclidean Space
- A fast \((2 + 2/7)\)-approximation algorithm for capacitated cycle covering
- A tree-covering problem arising in integrity of tree-structured data
- Min-max cover of a graph with a small number of parts
- Covering Directed Graphs by In-Trees
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Minmax subtree cover problem on cacti
- A minimum-length covering subtree of a tree
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- Minimal vertex covers of random trees
- Approximating the minmax rooted-tree cover in a tree
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
- Better approximability results for min-max tree/cycle/path cover problems
- Approximation algorithms for metric tree cover and generalized tour and tree covers
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- New approximation algorithms for the rooted budgeted cycle cover problem
- On optimal coverage of a tree with multiple robots
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
- New approximation algorithms for the minimum cycle cover problem
- Improved approximation algorithms for min-max and minimum vehicle routing problems
- Graph covering using bounded size subgraphs
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Vehicle routing with subtours
- Capacitated vehicle routing with nonuniform speeds
- Approximation to the Minimum Rooted Star Cover Problem
- Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems
- Approximation hardness of min-max tree covers
- New approximation algorithms for the rooted budgeted cycle cover problem
- Approximation algorithms for some minimum postmen cover problems
This page was built for publication: Min-max tree covers of graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703232)
