The following pages link to Partial multicuts in trees (Q861281):
Displaying 11 items.
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- The checkpoint problem (Q714790) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Path hitting in acyclic graphs (Q1018049) (← 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)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689) (← links)
- An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties (Q6620014) (← links)
