Pages that link to "Item:Q1270776"
From MaRDI portal
The following pages link to Approximation algorithms for minimum tree partition (Q1270776):
Displaying 13 items.
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134) (← links)
- Minimum Cost Partitions of Trees with Supply and Demand (Q3060787) (← 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)
- Heuristics with Constant Error Guarantees for the Design of Tree Networks (Q3780780) (← links)
- Approximation Algorithms for Min–Max Tree Partition (Q4360130) (← links)
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks (Q6629668) (← links)
