Pages that link to "Item:Q1224109"
From MaRDI portal
The following pages link to On the ratio of optimal integral and fractional covers (Q1224109):
Displaying 50 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- Improved performance of the greedy algorithm for partial cover (Q293139) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Towards the price of leasing online (Q346515) (← links)
- Black-box Trace\&Revoke codes (Q378263) (← links)
- Rainbow edge-coloring and rainbow domination (Q383777) (← links)
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
- The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- Weighted covering numbers of convex sets (Q531815) (← links)
- Capacitated domination problem (Q534769) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- On roman, global and restrained domination in graphs (Q659738) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Relative blocking sets of unions of Baer subplanes (Q670209) (← links)
- Improved parallel approximation of a class of integer programming problems (Q676274) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Write-isolated memories (WIMs) (Q685662) (← links)
- Min-sum bin packing (Q721936) (← links)
- Covering compact metric spaces greedily (Q722361) (← links)
- The ordered covering problem (Q722532) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- A randomised approximation algorithm for the hitting set problem (Q744051) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs (Q839632) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- Average stretch analysis of compact routing schemes (Q875595) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- On weighted covering numbers and the Levi-Hadwiger conjecture (Q891149) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- The \(k\)-tuple domination number revisited (Q952712) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- The minimum substring cover problem (Q958306) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership (Q976067) (← links)
- On the geodetic and geodetic domination numbers of a graph (Q982620) (← links)
