Pages that link to "Item:Q1969763"

The following pages link to On approximation of the submodular set cover problem (Q1969763):

Displaying 10 items.

• Partial multicovering and the \(d\)-consecutive ones property (Q408373) (← links)
• A unified approach to approximating partial covering problems (Q633845) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• Approximation algorithm for vertex cover with multiple covering constraints (Q2072095) (← links)
• An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689) (← links)
• Submodular Function Minimization under a Submodular Set Covering Constraint (Q3010395) (← links)
• (Q5091035) (← links)
• Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
• Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
• Approximating power node-deletion problems (Q6593676) (← links)