Pages that link to "Item:Q634686"
From MaRDI portal
The following pages link to Improved approximation algorithms for label cover problems (Q634686):
Displaying 8 items.
- Improved approximation algorithms for projection games (Q513283) (← links)
- On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)
- (Q5009502) (← links)
- (Q5077145) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
