Pages that link to "Item:Q3581503"

The following pages link to Approximating the <i>k</i>-multicut problem (Q3581503):

Displaying 10 items.

• Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
• An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
• Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
• Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
• A unified approach to approximating partial covering problems (Q633845) (← links)
• The checkpoint problem (Q714790) (← links)
• Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• Partial multicuts in trees (Q861281) (← links)
• An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)