Pages that link to "Item:Q3503854"

The following pages link to Primal-Dual Schema for Capacitated Covering Problems (Q3503854):

Displaying 18 items.

• Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
• On set expansion problems and the small set expansion conjecture (Q494429) (← links)
• LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
• Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
• Primal-dual schema for capacitated covering problems (Q747765) (← links)
• Supermodular covering knapsack polytope (Q1751131) (← links)
• Easy knapsacks and the complexity of energy allocation problems in the smart grid (Q1800444) (← links)
• Precedence-constrained covering problems with multiplicity constraints (Q2085754) (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
• Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
• Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
• A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q3088089) (← links)
• Primal-Dual Algorithms for Precedence Constrained Covering Problems (Q3453300) (← links)
• Resource allocation problem under single resource assignment (Q4553878) (← links)
• Improved Algorithm for Resource Allocation Problems (Q4604919) (← links)
• A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558) (← links)