Pages that link to "Item:Q4575829"
From MaRDI portal
The following pages link to ETH Hardness for Densest-<i>k</i>-Subgraph with Perfect Completeness (Q4575829):
Displayed 8 items.
- Orienteering for electioneering (Q2417102) (← links)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- (Q4638096) (← links)
- (Q5009502) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
- (Q6084394) (← links)