"Inapproximability of Maximum Biclique Problems, Minimum k-Cut and ..."

Pasin Manurangsi (2018)

> Home

Details and statistics

DOI: 10.3390/A11010010

access: open

type: Journal Article

metadata version: 2018-08-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithms/Manurangsi18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithms/Manurangsi18
Pasin Manurangsi:
Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis. Algorithms 11(1): 10 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.