Pages that link to "Item:Q4373001"

The following pages link to A Tight Analysis of the Greedy Algorithm for Set Cover (Q4373001):

Displaying 24 items.

• On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
• Remoteness of permutation codes (Q427818) (← links)
• Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
• Cost sharing and strategyproof mechanisms for set cover games (Q604756) (← links)
• Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
• A unified approach to approximating partial covering problems (Q633845) (← links)
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
• Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• On the approximability of covering points by lines and related problems (Q904111) (← links)
• A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
• On approximation of the vertex cover problem in hypergraphs (Q1779691) (← links)
• Finding the maximal adversary structure from any given access structure (Q1999100) (← links)
• Approximating activation edge-cover and facility location problems (Q2166781) (← links)
• A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
• An approval-based model for single-step liquid democracy (Q2670941) (← links)
• AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639) (← links)
• Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
• The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
• Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
• A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
• (Q5092379) (← links)
• Combinatorial optimization algorithms for radio network planning (Q5941516) (← links)
• Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)