Pages that link to "Item:Q3167403"
From MaRDI portal
The following pages link to The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover (Q3167403):
Displayed 12 items.
- Improved approximation algorithms for projection games (Q513283) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- The Constant Inapproximability of the Parameterized Dominating Set Problem (Q4634028) (← links)
- Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)