Pages that link to "Item:Q2205937"

The following pages link to An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937):

Displaying 8 items.

• Partial multicuts in trees (Q861281) (← links)
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
• Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211) (← links)
• A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
• An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689) (← links)
• New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146) (← links)
• An approximation algorithm for the \(B\)-prize-collecting multicut problem in trees (Q6111962) (← links)
• \(W\)-prize-collecting scheduling problem on parallel machines (Q6646746) (← links)