Pages that link to "Item:Q1949749"

The following pages link to Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749):

Displaying 15 items.

• A note on submodular function minimization with covering type linear constraints (Q722536) (← links)
• Approximation algorithm for the multicovering problem (Q2025081) (← links)
• Precedence-constrained covering problems with multiplicity constraints (Q2085754) (← links)
• New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
• Group parking permit problems (Q2184679) (← links)
• A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
• An approximation algorithm for the partial covering 0-1 integer program (Q2297657) (← links)
• On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
• Multi-dimensional vector assignment problems (Q2339839) (← links)
• Online file caching with rejection penalties (Q2346958) (← links)
• Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
• Primal-Dual Algorithms for Precedence Constrained Covering Problems (Q3453300) (← links)
• (Q5009516) (← links)
• Precedence-constrained covering problems with multiplicity constraints (Q6039535) (← links)
• Algorithms for maximizing monotone submodular function minus modular function under noise (Q6046627) (← links)