"Polynomial time approximation of dense weighted instances of MAX-CUT."

Wenceslas Fernandez de la Vega, Marek Karpinski (2000)

> Home

Details and statistics

DOI: 10.1002/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/VegaK00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/VegaK00
Wenceslas Fernandez de la Vega, Marek Karpinski:
Polynomial time approximation of dense weighted instances of MAX-CUT. Random Struct. Algorithms 16(4): 314-332 (2000)

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.