Show simple item record

Approximation Algorithms for NP-Hard Problems

dc.date.accessioned2019-10-24T12:55:53Z
dc.date.available2019-10-24T12:55:53Z
dc.date.issued2004
dc.identifier.urihttp://publications.mfo.de/handle/mfo/2847
dc.description.abstractThe 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.titleApproximation Algorithms for NP-Hard Problems
dc.rights.licenseDieses 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.licenseThis 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.doi10.14760/OWR-2004-28
local.series.idOWR-2004-28
local.sortindex287
local.date-range06 Jun - 12 Jun 2004
local.workshopcode0424
local.workshoptitleApproximation Algorithms for NP-Hard Problems
local.organizersRavi Kannan, Yale; Marek Karpinski, Bonn; Hans Jürgen Prömel, Berlin
local.report-nameWorkshop Report 2004,28
local.opc-photo-id0424
local.publishers-doi10.4171/OWR/2004/28
local.ems-referenceKannan Ravindran, Karpinski Marek: Approximation Algorithms for NP-Hard Problems. Oberwolfach Rep. 1 (2004), 1461-1540. doi: 10.4171/OWR/2004/28


Files in this item

Thumbnail
Report

This item appears in the following Collection(s)

Show simple item record