"On the Hardness of Approximating the k-Way Hypergraph Cut problem."

Chandra Chekuri, Shi Li (2020)

> Home

Details and statistics

DOI: 10.4086/TOC.2020.V016A014

access: open

type: Journal Article

metadata version: 2021-04-29

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/toc/ChekuriL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/ChekuriL20
Chandra Chekuri, Shi Li:
On the Hardness of Approximating the k-Way Hypergraph Cut problem. Theory Comput. 16: 1-8 (2020)

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.