"Hypergraph k-cut in randomized polynomial time."

Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu (2021)

> Home

Details and statistics

DOI: 10.1007/S10107-019-01443-7

access: closed

type: Journal Article

metadata version: 2021-02-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/ChandrasekaranX21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/ChandrasekaranX21
Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu:
Hypergraph k-cut in randomized polynomial time. Math. Program. 186(1): 85-113 (2021)

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.