"Tight Approximation Ratio of a General Greedy Splitting Algorithm for the ..."

Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao (2011)

> Home

Details and statistics

DOI: 10.1007/S00453-009-9316-1

access: closed

type: Journal Article

metadata version: 2024-01-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/XiaoCY11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/XiaoCY11
Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. Algorithmica 59(4): 510-520 (2011)

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.