Date: Thu, 10 Apr 2003 11:17:39 +0200 (MEST) From: Klaus Jansen Sender: dmanet-admin@zpr.uni-koeln.de To: DMANET@zpr.uni-koeln.de Cc: solis@csd.uwo.ca, kj@informatik.uni-kiel.de, pkm@informatik.uni-kiel.de Subject: [DMANET] CfP: WAOA 2003, Budapest Call for Papers WAOA 2003 First Workshop on Approximation and Online Algorithms 15 - 20 September 2003 Budapest, Hungary SCOPE: Approximation and online algorithms are fundamental tools used to deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems have a vast number of applications arising from a variety of fields. The workshop focuses on the design and analysis of algorithms for online and computationally hard problems. The workshop also covers experimental methods used to design efficient approximation and online algorithms. The workshop is part of ALGO 2003, which also hosts ESA 2003, WABI 2003,and ATMOS 2003. The event will take place in beautiful Budapest, Hungary, from September 15 to September 20. TOPICS: Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to: * paradigms * inapproximability results * competitive analysis * randomization techniques * approximation classes * scheduling problems * coloring and partitioning * cuts and connectivity * packing and covering * geometric problems * network design * applications to game theory * financial problems PUBLICATION: The proceedings of the workshop will be published as a volume in either the series Lecture Notes in Computer Science or Electronic Notes in Theoretical Computer Science. Proceedings will be published after the workshop takes place. Authors of the best papers presented at the workshop will be invited to submit full versions of their conference papers to a special issue of Theoretical Computer Science. SUBMISSION GUIDELINES: Authors are invited to submit an extended abstract or full paper of at most 12 pages describing original unpublished research. Submissions should consist of: a cover page, with the author's full name, address, fax number, and e-mail address; a 100-word abstract summarizing the results; a description of the main results and an explanation of their importance. Proofs omitted due to space limitations must be included in an appendix to be read by the program committee members at their discretion. We encourage the authors to submit electronically their papers. For an electronic submission, please send a postscript file with the paper to solis@csd.uwo.ca The postscript file must be received by 23:59 Pacific Time on June 30, 2003. Contributions might also be submitted by mailing 6 copies of the manuscript to: Prof. Klaus Jansen Institut fur Informatik und Praktische Mathematik Universitat Kiel Christian-Albrecht Platz 4 D-24118 Kiel Germany It is expected that all accepted papers will be presented at the workshop by one of the authors. IMPORTANT DATES: Submissions: June 30, 2003 Notifications: August 5, 2003 Camera Ready: August 30, 2003 Workshop: September 15-20, 2003 ARACNE MINI-SYMPOSIUM An ARACNE mini-symposium on approximation and randomized algorithms in communication networks will take place as part of the workshop. PROGRAM CHAIRs: Klaus Jansen, University of Kiel (kj@informatik.uni-kiel.de) Roberto Solis-Oba, University of Western Ontario (solis@csd.uwo.ca) PROGRAM COMMITTEE: Susanne Albers (University of Freiburg) Evripidis Bampis (University of Evry) Danny Chen (University of Notre Dame) Amos Fiat (Tel Aviv University) Rudolf Fleischer (Honk Kong University of Science and Technology) Klaus Jansen (University of Kiel) Pino Persiano (University of Salerno) Jose Rolim (University of Geneva) Roberto Solis-Oba (University of Western Ontario) Martin Skutella (Max-Planck-Institute Saarbruecken) For more information please contact Klaus Jansen or Roberto Solis-Oba. **********************************************************