Pages that link to "Item:Q839632"
From MaRDI portal
The following pages link to Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632):
Displaying 15 items.
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
- A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Oblivious algorithms for the maximum directed cut problem (Q2346965) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Near-Optimal Asymmetric Binary Matrix Partitions (Q2946372) (← links)
- Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (Q3004668) (← links)
- (Q5092379) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)
