Pages that link to "Item:Q2633244"
From MaRDI portal
The following pages link to Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244):
Displaying 19 items.
- On set expansion problems and the small set expansion conjecture (Q494429) (← links)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- On a connection between small set expansions and modularity clustering (Q2446591) (← links)
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs (Q2633284) (← links)
- Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut (Q3020016) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
- Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6138832) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
- Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6535803) (← links)
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037) (← links)
- Approximating submodular \(k\)-partition via principal partition sequence (Q6654129) (← links)
- A parameterized approximation scheme for min \(k\)-cut (Q6654555) (← links)
