Pages that link to "Item:Q5111410"
From MaRDI portal
The following pages link to Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis (Q5111410):
Displaying 8 items.
- On the complexity of fair house allocation (Q2060606) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- (Q5077149) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs (Q6657247) (← links)
