0424

Approximation Algorithms for NP-Hard Problems

Thumbnail
View/Open
DOI
10.14760/OWR-2004-28
Publisher's DOI
10.4171/OWR/2004/28
Collections
Metadata
Show full item record
Workshop
0424
Period
06 Jun - 12 Jun 2004
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.
Report
Workshop Report 2004,28
Organizers
Ravi Kannan, Yale; Marek Karpinski, Bonn; Hans Jürgen Prömel, Berlin
EMS Reference
Kannan Ravindran, Karpinski Marek: Approximation Algorithms for NP-Hard Problems. Oberwolfach Rep. 1 (2004), 1461-1540. doi: 10.4171/OWR/2004/28
Oberwolfach Photo Collection
Open Workshop Photos

Preview
Report