0424
Approximation Algorithms for NP-Hard Problems
Report (669.1Kb)Workshop
0424Period
06 Jun - 12 Jun 2004Abstract
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.
Report
Workshop Report 2004,28Organizers
Ravi Kannan, Yale; Marek Karpinski, Bonn; Hans Jürgen Prömel, BerlinEMS Reference
Kannan Ravindran, Karpinski Marek: Approximation Algorithms for NP-Hard Problems. Oberwolfach Rep. 1 (2004), 1461-1540. doi: 10.4171/OWR/2004/28Oberwolfach Photo Collection
Open Workshop PhotosThe following license files are associated with this item:
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.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.
Open Preview