Pages that link to "Item:Q3581279"
From MaRDI portal
The following pages link to A new multilayered PCP and the hardness of hypergraph vertex cover (Q3581279):
Displayed 13 items.
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- Disjoint bases in a polymatroid (Q3055784) (← links)
- Is constraint satisfaction over two variables always easy? (Q3156915) (← links)
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609) (← links)
- On the Minimum Hitting Set of Bundles Problem (Q3511409) (← links)
- Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (Q3608306) (← links)