"Polynomially Bounded Minimization Problems which are Hard to Approximate."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Viggo Kann (1993)

> Home

Details and statistics

DOI: 10.1007/3-540-56939-1_61

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/Kann93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Kann93
Viggo Kann:
Polynomially Bounded Minimization Problems which are Hard to Approximate. ICALP 1993: 52-63

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.