The following pages link to Anand Louis (Q378097):
Displaying 18 items.
- A 3-approximation algorithm for the facility location problem with uniform capacities (Q378101) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- (Q2830864) (← links)
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms (Q2941566) (← links)
- Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion (Q2969629) (← links)
- Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) (← links)
- Improved Algorithm for Degree Bounded Survivable Network Design Problem (Q3569909) (← links)
- Spectral Properties of Hypergraph Laplacian and Approximation Algorithms (Q4561502) (← links)
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)
- Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
- Approximation Algorithm for Sparsest <i>k</i>-Partitioning (Q5384054) (← links)
- Many sparse cuts via higher eigenvalues (Q5415540) (← links)
- Linear Programming Hierarchies Suffice for Directed Steiner Tree (Q5419003) (← links)
- (Q5875482) (← links)
- Planted Models for k-Way Edge and Vertex Expansion (Q5875657) (← links)
- Exact recovery algorithm for planted bipartite graph in semi-random graphs (Q6560882) (← links)
- Approximating CSPs with outliers (Q6591896) (← links)
- New approximation bounds for small-set vertex expansion (Q6645443) (← links)
