"Complexity and approximation: combinatorial optimization problems and ..."

Giorgio Ausiello et al. (1999)

> Home

Details and statistics

DOI: 10.1007/978-3-642-58412-1

access: closed

type: Book or Thesis

metadata version: 2022-05-04

- view
  - electronic edition @ springer.com
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - books/lib/Ausiello99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/lib/Ausiello99
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann:
Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer 1999, ISBN 3540654313, pp. I-XIX, 1-524

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.