Min-max tree covers of graphs.
DOI10.1016/J.ORL.2003.11.010zbMATH Open1054.90079OpenAlexW1974713906MaRDI QIDQ703232FDOQ703232
Jochen Könemann, Amitabh Sinha, Guy Even, Naveen Garg, R. Ravi
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.11.010
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
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)
Cites Work
Cited In (42)
- Approximation hardness of min-max tree covers
- An overview of graph covering and partitioning
- Capacitated Vehicle Routing with Non-uniform Speeds
- New approximation algorithms for the rooted budgeted cycle cover problem
- Approximating the minmax rooted-tree cover in a tree
- An approximation algorithm for vehicle routing with compatibility constraints
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- Minmax Tree Cover in the Euclidean Space
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring
- Vehicle routing with subtours
- Continuous graph partitioning for camera network surveillance
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- The heterogeneous rooted tree cover problem
- Approximation results for min-max path cover problems in vehicle routing
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
- Minimal vertex covers of random trees
- Minimum makespan vehicle routing problem with compatibility constraints
- Capacitated vehicle routing with nonuniform speeds
- Approximation results for a min-max location-routing problem
- New LP relaxations for minimum cycle/path/tree cover problems
- Better approximability results for min-max tree/cycle/path cover problems
- Minmax subtree cover problem on cacti
- Multiple UAV exploration of an unknown region
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
- The \(m\)-Steiner traveling salesman problem with online edge blockages
- Approximation Algorithms for Generalized Bounded Tree Cover
- New approximation algorithms for the rooted budgeted cycle cover problem
- Covering directed graphs by in-trees
- On optimal coverage of a tree with multiple robots
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Covering Directed Graphs by In-Trees
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- New approximation algorithms for the minimum cycle cover problem
- Title not available (Why is that?)
- A minimum-length covering subtree of a tree
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- Approximation algorithms for some minimum postmen cover problems
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
- Min-max cover of a graph with a small number of parts
- Graph covering using bounded size subgraphs
Uses Software
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)
