Pages that link to "Item:Q4228484"
From MaRDI portal
The following pages link to A threshold of \(\ln n\) for approximating set cover (Q4228484):
Displaying 50 items.
- Improved performance of the greedy algorithm for partial cover (Q293139) (← links)
- On the union of intermediate nodes of shortest paths (Q358654) (← links)
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Evaluation of monotone DNF formulas (Q521804) (← links)
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- Preserving approximation in the min-weighted set cover problem (Q674914) (← links)
- Center-based clustering under perturbation stability (Q763489) (← links)
- A derandomization using min-wise independent permutations (Q876688) (← links)
- Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469) (← links)
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership (Q976067) (← links)
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048) (← links)
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (Q1026247) (← links)
- A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- Alarm placement in systems with fault propagation (Q1575642) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- Generalized submodular cover problems and applications (Q1589434) (← links)
- On the flow cost lowering problem (Q1600835) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Approximation algorithms for terrain guarding. (Q1603553) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- Relational data factorization (Q1699908) (← links)
- The complexity of base station positioning in cellular networks (Q1775056) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- On approximation of the submodular set cover problem (Q1969763) (← links)
- Finding the maximal adversary structure from any given access structure (Q1999100) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem (Q2099386) (← links)
- Optimal approximations made easy (Q2122796) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Minimum non-submodular cover problem with applications (Q2245054) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- Construction of component tapes for radial placement machines (Q2379659) (← links)
