Pages that link to "Item:Q3158517"
From MaRDI portal
The following pages link to A threshold of ln <i>n</i> for approximating set cover (Q3158517):
Displaying 50 items.
- Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations (Q73947) (← links)
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- Faster approximation algorithms for maximizing a monotone submodular function subject to a \(b\)-matching constraint (Q284354) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Give-and-take based peer-to-peer content distribution networks (Q301622) (← links)
- Multi-level facility location as the maximization of a submodular set function (Q320143) (← links)
- Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← links)
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Refined algorithms for hitting many intervals (Q344570) (← links)
- Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- Towards the price of leasing online (Q346515) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- Black-box Trace\&Revoke codes (Q378263) (← links)
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- Fast approximate energy minimization with label costs (Q409135) (← links)
- Geometric rounding: A dependent randomized rounding scheme (Q411220) (← links)
- A closest vector problem arising in radiation therapy planning (Q411241) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- The class cover problem with boxes (Q419500) (← links)
- On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- Online maximum \(k\)-coverage (Q442204) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- Complexity and approximation of the connected set-cover problem (Q453623) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- Computing on binary strings (Q476852) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- Detecting monomials with \(k\) distinct variables (Q477587) (← links)
- The computational complexity and approximability of a series of geometric covering problems (Q483201) (← links)
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- Computing cooperative solution concepts in coalitional skill games (Q490424) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- A note on the clustered set covering problem (Q496643) (← links)
