Pages that link to "Item:Q2875199"
From MaRDI portal
The following pages link to Graph expansion and the unique games conjecture (Q2875199):
Displaying 50 items.
- Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- Spectral algorithms for unique games (Q645126) (← links)
- Lower bounds for treewidth of product graphs (Q741743) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- On the complexity of fair house allocation (Q2060606) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- Log-Sobolev inequality for the multislice, with applications (Q2119683) (← links)
- Finding Cheeger cuts in hypergraphs via heat equation (Q2166752) (← links)
- Election control through social influence with voters' uncertainty (Q2168756) (← links)
- Sampling-based dimension reduction for subspace approximation with outliers (Q2222095) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- The Small Set Vertex expansion problem (Q2232595) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives (Q2417370) (← links)
- On a connection between small set expansions and modularity clustering (Q2446591) (← links)
- A note on the set union knapsack problem (Q2449074) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Expander spanning subgraphs with large girth (Q2689227) (← links)
- Approximation algorithms for hypergraph small-set expansion and small-set vertex expansion (Q2830864) (← links)
- Finding Connected Dense $$k$$-Subgraphs (Q2948471) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
- Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion (Q2969629) (← links)
- Gap Amplification for Small-Set Expansion via Random Walks. (Q2969633) (← links)
- Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions (Q3088104) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- Subexponential Algorithms for Unique Games and Related Problems (Q3177749) (← links)
- Dimension-free L2 maximal inequality for spherical means in the hypercube (Q3191610) (← links)
- Decomposing a graph into expanding subgraphs (Q4601444) (← links)
- Approximation Algorithms for CSPs (Q4993604) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)
- (Q5009495) (← links)
- (Q5009502) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- On the proof of the 2-to-2 Games Conjecture (Q5015837) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- (Q5054600) (← links)
- (Q5077149) (← links)
- (Q5090410) (← links)
- (Q5090422) (← links)
- (Q5091271) (← links)
- Computational topology and the Unique Games Conjecture (Q5115811) (← links)
