"Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time."

Karthekeyan Chandrasekaran, Chandra Chekuri (2022)

> Home

Details and statistics

DOI: 10.1287/MOOR.2021.1250

access: closed

type: Journal Article

metadata version: 2023-08-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mor/ChandrasekaranC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/ChandrasekaranC22
Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time. Math. Oper. Res. 47(4): 3380-3399 (2022)

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.