Pages that link to "Item:Q634686"
From MaRDI portal
The following pages link to Improved approximation algorithms for label cover problems (Q634686):
Displaying 14 items.
- Improved approximation algorithms for projection games (Q513283) (← links)
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541) (← links)
- On the hardness of approximating label-cover (Q1029090) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i> -Spanner (Q4962219) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- (Q5009502) (← links)
- Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- (Q5875460) (← links)