Pages that link to "Item:Q423940"

The following pages link to An approximation algorithm for the generalized \(k\)-multicut problem (Q423940):

Displaying 11 items.

• Partial multicuts in trees (Q861281) (← links)
• A generalized \(\alpha\)-cut (Q1602896) (← links)
• 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)
• An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937) (← links)
• On the generalized multiway cut in trees problem (Q2436662) (← links)
• An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
• Generalized \(k\)-multiway cut problems (Q2504075) (← links)
• \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau (Q2884566) (← 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)