The following pages link to Maximal covering tree problems (Q4695786):
Displaying 14 items.
- Min-max tree covers of graphs. (Q703232) (← links)
- A tree-covering problem arising in integrity of tree-structured data (Q975533) (← links)
- 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 (Q976129) (← links)
- A review of extensive facility location in networks (Q1278421) (← links)
- Efficient solution methods for covering tree problems (Q1284598) (← links)
- Optimal direct and indirect covering trees (Q1417719) (← links)
- The maximum utilization subtree problem (Q1872019) (← links)
- Extremal cover cost and reverse cover cost of trees with given segment sequence (Q2297740) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- (Q3169852) (← links)
- Maximal Direct Covering Tree Problems (Q3474491) (← links)
- The Maximal Conditional Covering Problem (Q5689924) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5920611) (← links)
