Pages that link to "Item:Q679446"
From MaRDI portal
The following pages link to Randomized approximation of bounded multicovering problems (Q679446):
Displaying 19 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- Approximation algorithm for the multicovering problem (Q2025081) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems (Q2892221) (← links)
- A Better bound of randomized algorithms for the multislope ski-rental problem (Q4602379) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313045) (← links)
- Proximity bounds for random integer programs (Q5918434) (← links)
- Approximate set union via approximate randomization (Q5919116) (← links)
- Proximity bounds for random integer programs (Q5925654) (← links)
- On uniform covering, adaptive random search and raspberries (Q5927659) (← links)
- An approximation algorithm for the partial vertex cover problem in hypergraphs (Q5963655) (← links)
- Online multiset submodular cover (Q6582377) (← links)
