Pages that link to "Item:Q1270776"
From MaRDI portal
The following pages link to Approximation algorithms for minimum tree partition (Q1270776):
Displaying 4 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)
- Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks (Q6629668) (← links)
