The following pages link to (Q5111409):
Displayed 25 items.
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Improved parameterized approximation for balanced \(k\)-median (Q2150584) (← links)
- Taming correlations through entropy-efficient measure decompositions with applications to mean-field approximation (Q2174660) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- (Q5091192) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Imperfect gaps in Gap-ETH and PCPs (Q5091784) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- (Q5875468) (← links)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm (Q5890148) (← links)
- Lower tails via relative entropy (Q6102952) (← links)
- Complexity of minimum-size arc-inconsistency explanations (Q6154178) (← links)
- Approximation schemes for \(k\)-facility location (Q6168971) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)