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.
- $$\epsilon $$-Almost Selectors and Their Applications (Q2947885) (← links)
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps (Q3009761) (← links)
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
- A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube (Q3068811) (← links)
- Inapproximability of b-Matching in k-Uniform Hypergraphs (Q3078381) (← links)
- Minimal Subsidies in Expense Sharing Games (Q3162532) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- Multiple Domination (Q3384609) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- Note on a problem of M. Talagrand (Q3460512) (← links)
- Asymptotics of the chromatic number for quasi-line graphs (Q3503489) (← links)
- The Hardness of Approximating Poset Dimension (Q3503501) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- On Partial Covers, Reducts and Decision Rules (Q3600307) (← links)
- On the Approximability of Some Haplotyping Problems (Q3638438) (← links)
- Absolute bounds on optimal cost for a class of set covering problems (Q3818802) (← links)
- Heuristics for the fixed cost median problem (Q3929508) (← links)
- Worst case analysis of a class of set covering heuristics (Q3951908) (← links)
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs (Q4210164) (← links)
- Minimizing number of wavelengths in multicast routing trees in WDM networks (Q4506266) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- A broadcast key distribution scheme based on block designs (Q4608491) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- The Growth Constant of Odd Cutsets in High Dimensions (Q4643314) (← links)
- Approximating k-set cover and complementary graph coloring (Q4645918) (← links)
- Paths, Stars and the Number Three (Q4715272) (← links)
- On the Greedy Heuristic for Continuous Covering and Packing Problems (Q4750653) (← links)
- Sublinear Graph Approximation Algorithms (Q4933367) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- Independent dominating sets in graphs of girth five (Q4993127) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
- Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols (Q5028500) (← links)
- A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets (Q5041795) (← links)
- Recent results in hardness of approximation (Q5054764) (← links)
- Point probe decision trees for geometric concept classes (Q5060103) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- On the metric dimension of incidence graph of M\"obius planes (Q5080905) (← links)
- (Q5090432) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- A comparison of two lower bound methods for communication complexity (Q5096890) (← links)
- Approximation algorithms for a genetic diagnostics problem (Q5096927) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Technical Note—Online Hypergraph Matching with Delays (Q5106363) (← links)
- Clustering in Hypergraphs to Minimize Average Edge Service Time (Q5111753) (← links)
- Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs (Q5130515) (← links)
- An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
