Pages that link to "Item:Q1082267"

The following pages link to A fast approximation algorithm for the multicovering problem (Q1082267):

Displaying 37 items.

• Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
• A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (Q342539) (← links)
• LP-based covering games with low price of anarchy (Q493659) (← links)
• Heuristic solutions and confidence intervals for the multicovering problem (Q579132) (← links)
• Approximability of sparse integer programs (Q634673) (← links)
• Approximating integer programs with positive right-hand sides (Q656570) (← links)
• Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
• Randomized approximation of bounded multicovering problems (Q679446) (← links)
• Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
• A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
• Set multi-covering via inclusion-exclusion (Q837180) (← links)
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
• Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
• A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
• Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
• The multicovering problem (Q1205691) (← links)
• Pareto optimality and a class of set covering heuristics (Q1309875) (← links)
• Rounding algorithms for covering problems (Q1380937) (← links)
• A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
• One for the price of two: a unified approach for approximating covering problems (Q1977131) (← links)
• Approximation algorithm for the multicovering problem (Q2025081) (← links)
• Exact multi-covering problems with geometric sets (Q2075389) (← links)
• A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
• Customer order scheduling to minimize the number of late jobs (Q2371386) (← links)
• Admission control with advance reservations in simple networks (Q2466012) (← links)
• Minimum monopoly in regular and tree graphs (Q2497525) (← links)
• Approximation of the clustered set covering problem (Q2883599) (← links)
• A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
• On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types (Q4965106) (← links)
• On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)
• A constant-factor approximation for multi-covering with disks (Q5174484) (← links)
• The multi‐integer set cover and the facility terminal cover problem (Q5191129) (← links)
• Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
• Computing Convex Coverage Sets for Faster Multi-objective Coordination (Q5246704) (← links)
• Online multiset submodular cover (Q6582377) (← links)