"On the Hardness of Approximating Max k-Cut and its Dual."

Viggo Kann et al. (1997)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition @ uchicago.edu (open access)
- export record
  dblp key:
  - journals/cjtcs/KannKLP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cjtcs/KannKLP97
Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and its Dual. Chic. J. Theor. Comput. Sci. 1997 (1997)

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.