Approximation Algorithms for NP-Hard Problems

dc.date.accessioned	2019-10-24T12:55:53Z
dc.date.available	2019-10-24T12:55:53Z
dc.date.issued	2004
dc.identifier.uri	http://publications.mfo.de/handle/mfo/2847
dc.description.abstract	The workshop was concerned with the most important recent developments in the area of efficient approximation algorithms for NP-hard optimization problems as well as with new techniques for proving intrinsic lower bounds for efficient approximation.
dc.title	Approximation Algorithms for NP-Hard Problems
dc.rights.license	Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.	de
dc.rights.license	This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.	en
dc.identifier.doi	10.14760/OWR-2004-28
local.series.id	OWR-2004-28
local.sortindex	287
local.date-range	06 Jun - 12 Jun 2004
local.workshopcode	0424
local.workshoptitle	Approximation Algorithms for NP-Hard Problems
local.organizers	Ravi Kannan, Yale; Marek Karpinski, Bonn; Hans Jürgen Prömel, Berlin
local.report-name	Workshop Report 2004,28
local.opc-photo-id	0424
local.publishers-doi	10.4171/OWR/2004/28
local.ems-reference	Kannan Ravindran, Karpinski Marek: Approximation Algorithms for NP-Hard Problems. Oberwolfach Rep. 1 (2004), 1461-1540. doi: 10.4171/OWR/2004/28

Report