Pages that link to "Item:Q2082211"
From MaRDI portal
The following pages link to Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211):
Displaying 3 items.
- Submodular unsplittable flow on trees (Q1801021) (← links)
- An approximation algorithm for the \(B\)-prize-collecting multicut problem in trees (Q6111962) (← links)
- An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties (Q6620014) (← links)