"Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint."

Maxim Sviridenko (2001)

> Home

Details and statistics

DOI: 10.1007/S00453-001-0019-5

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Sviridenko01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Sviridenko01
Maxim Sviridenko:
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. Algorithmica 30(3): 398-405 (2001)

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.