General Information
Dates:
Monday, August 22, 2005 - Wednesday, August 24, 2005
Days of Week:
Monday
Tuesday
Wednesday
Tuesday
Wednesday
Target Audience:
Academic and Practice
Location:
UC Berkeley
Event Details/Other Comments:
APPROX'2005 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.
TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:
APPROX
* design and analysis of approximation algorithms
* hardness of approximation
* small space and data streaming algorithms
* sub-linear time algorithms
* embeddings and metric space methods
* mathematical progamming methods
* coloring and partitioning
* cuts and connectivity
* game theory and applications
* geometric problems
* network design and routing
* packing and covering
* scheduling
* other applications