Pages that link to "Item:Q2581755"

The following pages link to An improved approximation algorithm for vertex cover with hard capacities (Q2581755):

Displaying 22 items.

• A model for minimizing active processor time (Q487001) (← links)
• Capacitated domination problem (Q534769) (← links)
• Primal-dual schema for capacitated covering problems (Q747765) (← links)
• Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
• \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities (Q1741845) (← links)
• Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
• Capacitated covering problems in geometric spaces (Q2189730) (← links)
• Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
• Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
• Tight approximation for partial vertex cover with hard capacities (Q2420573) (← links)
• Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
• Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
• On hard instances of approximate vertex cover (Q4962765) (← links)
• Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
• Tight approximation for partial vertex cover with hard capacities (Q5136285) (← links)
• The multi‐integer set cover and the facility terminal cover problem (Q5191129) (← links)
• Capacitated Domination Problem (Q5387762) (← links)
• (Q5874473) (← links)
• Approximation of Partial Capacitated Vertex Cover (Q5892615) (← links)
• Capacitated discrete unit disk cover (Q5918931) (← links)
• Improved bounds for metric capacitated covering problems (Q6107884) (← links)
• Online multiset submodular cover (Q6582377) (← links)