Pages that link to "Item:Q4360130"
From MaRDI portal
The following pages link to Approximation Algorithms for Min–Max Tree Partition (Q4360130):
Displaying 21 items.
- Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- Min-max tree covers of graphs. (Q703232) (← links)
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems (Q817816) (← links)
- Approximation algorithms for minimum tree partition (Q1270776) (← links)
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- On the complexity of partitioning a graph into a few connected subgraphs (Q2352361) (← links)
- Approximation Algorithms for Generalized Bounded Tree Cover (Q2803829) (← links)
- Minimum Cost Partitions of Trees with Supply and Demand (Q3060787) (← links)
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
- (Q3334089) (← links)
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees (Q3339302) (← links)
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand (Q3452563) (← links)
- Minimax Trees in Linear Time with Applications (Q3651553) (← links)
- BALANCED PARTITION OF MINIMUM SPANNING TREES (Q4818586) (← links)
- Minmax tree cover in the Euclidean space (Q5891341) (← links)
- (Q6084420) (← links)
- Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks (Q6629668) (← links)
