Pages that link to "Item:Q423940"
From MaRDI portal
The following pages link to An approximation algorithm for the generalized \(k\)-multicut problem (Q423940):
Displaying 3 items.
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
