"Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time."

Karthekeyan Chandrasekaran, Chandra Chekuri (2020)

> Home

Details and statistics

DOI: 10.1109/FOCS46700.2020.00080

access: closed

type: Conference or Workshop Paper

metadata version: 2021-01-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/ChandrasekaranC20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/ChandrasekaranC20
Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. FOCS 2020: 810-821

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.