A minimum-length covering subtree of a tree
From MaRDI portal
Recommendations
- The minimal number of subtrees of a tree
- Approximating the minmax rooted-tree cover in a tree
- Min-max tree covers of graphs.
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Minmax subtree cover problem on cacti
- Packing and covering a tree by subtrees
- A minimum length covering subgraph of a network
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
- On the minimum vertex k-path cover of trees
- Minimum consistent subset problem for trees
Cites work
Cited in
(10)- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- A minimum length covering subgraph of a network
- Efficient solution methods for covering tree problems
- Comments on: ``Extensive facility location problems on networks: an updated review
- The maximum utilization subtree problem
- Locating A Median Subtree On A Network
- A unifying location model on tree graphs based on submodularity property
- Minmax subtree cover problem on cacti
- Indirect covering tree problems on spanning tree networks
- A review of extensive facility location in networks
This page was built for publication: A minimum-length covering subtree of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479805)