Logic List Mailing Archive

APPROX+RANDOM 2007, Princeton (U.S.A.), 20-22 Aug 2007

CALL FOR PAPERS
                       APPROX 2007 + RANDOM 2007
                       10th. International Workshop on
    Approximation Algorithms for Combinatorial Optimization Problems
                                  and
                     11th. International Workshop on
                      Randomization and Computation
                           20-22 August 2007
                          Princeton University

SCOPE

The 10th. International Workshop on Approximation Algorithms for 
Combinatorial Optimization Problems (APPROX'2007), and the 11th. 
International Workshop on Randomized Techniques in Computation 
(RANDOM'2007) will be held at Princeton University, on August 20-22, 2007.

APPROX'2007 focuses on algorithmic and complexity theoretic issues 
relevant to the development of efficient approximate solutions to 
computationally difficult problems, while RANDOM'2007 focuses on 
applications of randomness to computational and combinatorial problems. 
RANDOM'2007 is the eleventh workshop in the series; APPROX'2007 is the 
tenth in the series.

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



              RANDOM

* design and analysis of randomized algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
* probabilistic proof systems
* random projections and embeddings
* error-correcting codes
* average-case analysis
* property testing
* computational learning theory



PUBLICATION

Proceedings will be published in the Springer-Verlag series Lecture Notes
 
in Computer Science. Previous proceedings of APPROX appeared as LNCS 1444,
 
1671, 1913, 2129, 2462, 2764, 3122, 3624 and 4110, while previous 
proceedings of RANDOM appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764,
 
3122, 3624, 4110 and as Proceedings in Informatics 8.

GUIDELINES FOR SUBMISSION

Electronic submissions are solicited.

To submit a paper electronically or for more specific instructions about 
APPROX, please consult http://cui.unige.ch/random-approx. To submit a 
paper electronically or for more specific instructions about RANDOM, 
please consult http://cui.unige.ch/random-approx.

The postscript must be received by 17:00pm (PDT) of April 7 for your 
submission to be considered.

Abstract Format: Authors should submit an extended abstract (not a full 
paper). An abstract should start with the title of the paper, each 
author's name, affiliation, and e-mail address, followed by a 
one-paragraph summary of the results to be presented. This should then be
 
followed by a technical exposition of the main ideas and techniques used 
to achieve these results, including motivation and a clear comparison with
 
related work. The abstract should not exceed 10 single-spaced pages on 
letter-size paper, using reasonable margins and at least 11-point font. If
 
the authors believe that more details are essential to substantiate the 
main claims of the paper, they may include a clearly marked appendix that
 
will be read at the discretion of the program committee.

IMPORTANT DATES

Submission Deadline:  April 7, 2007
Notification: May 27, 2007
Camera ready: June 10, 2007

PROGRAM COMMITTEES

APPROX:

Nikhil Bansal, IBM T J Watson
Moses Charikar, Princeton University, chair
Chandra Chekuri, University of Illinois, Urbana-Champaign
Julia Chuzhoy, IAS
Venkatesan Guruswami, University of Washington
Howard Karloff, AT&T Labs Research
Guy Kortsarz, Rutgers, Camden
Robert Krauthgamer, IBM Almaden
Claire Mathieu, Brown University
Seffi Naor, Microsoft Research and Technion
Chaitanya Swamy, University of Waterloo
Lisa Zhang, Bell Labs


RANDOM:

Irit Dinur, Hebrew University
Thomas Hayes, Toyota Technological Institute at Chicago
Piotr Indyk, MIT
Russell Martin, University of Liverpool
Dieter van Melkebeek, University of Wisconsin, Madison
Michael Mitzenmacher, Harvard University
Michael Molloy, University of Toronto
Cristopher Moore, University of New Mexico
Sofya Raskhodnikova, Penn State University
Omer Reingold, Weizmann Institute, chair
Ronen Shaltiel, University of Haifa
Asaf Shapira, Microsoft Research
Aravind Srinivasan, University of Maryland
Angelika Steger, ETH Z?rich
Emanuele Viola, IAS



PROGRAM COMMITTEES CHAIRS

APPROX
Moses Charikar, Princeton University
email: moses@cs.princeton.edu

RANDOM
Omer Reingold, Weizmann Institute
email: omer.reingold@weizmann.ac.il



WORKSHOP CHAIRS

Klaus Jansen, U. of Kiel
e-mail: kj@informatik.uni-kiel.de

Jos? Rolim, U. of Geneva
e-mail: rolim@cui.unige.ch

STEERING COMMITTEE

APPROX

Susanne Albers, U. of Freiburg
Dorit Hochbaum, UC Berkeley
Klaus Jansen, U. of Kiel
Samir Khuller, Maryland
Jos? Rolim, U. of Geneva
Vijay Vazirani, Georgia Tech

RANDOM

Josep Diaz, UPC Barcelona
Oded Goldreich, Weizmann
Klaus Jansen, U. of Kiel
Michael Luby, Digital Fountain
Christos Papadimitriou, UC Berkeley
Jose Rolim, U. of Geneva
Paul Spirakis, U. of Patras

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/