Maximal covering tree problems
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- scientific article; zbMATH DE number 5952201 (Why is no real title available?)
- Extremal cover cost and reverse cover cost of trees with given segment sequence
- A tree-covering problem arising in integrity of tree-structured data
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees
- Efficient solution methods for covering tree problems
- Optimal direct and indirect covering trees
- An optimal algorithm for single maximum coverage location on trees and related problems
- Min-max tree covers of graphs.
- The maximum utilization subtree problem
- Minmax subtree cover problem on cacti
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- A review of extensive facility location in networks
- The Maximal Conditional Covering Problem
- Maximal Direct Covering Tree Problems
- The Maximum Binary Tree Problem.
- scientific article; zbMATH DE number 1953104 (Why is no real title available?)
This page was built for publication: Maximal covering tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4695786)