APPROX 2011 and RANDOM 2011 14th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2011 15th Intl. Workshop on Randomization and Computation - RANDOM 2011 http://cui.unige.ch/tcs/random-approx/ Aug. 17-19, 2011 Princeton University Call for papers SCOPE 14th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2011 15th Intl. Workshop on Randomization and Computation - RANDOM 2011 The 14th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2011), and the 15th. International Workshop on Randomization and Computation (RANDOM'2011) will be held in 17-19 August 2011 at Princeton University. APPROX'2011 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2011 focus on applications of randomness to computational and combinatorial problems. RANDOM'2011 is the fifteenth workshop in the series; APPROX'2011 is the fourteenth 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, sub-linear time, and • streaming algorithms • embeddings and metric space methods • mathematical programming methods • combinatorial problems in graphs and • networks • game theory, markets, and economic • applications • geometric problems • packing, covering, and scheduling • approximate learning • 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 SUBMISSIONS Abstract Format: Electronic submissions are solicited. Please consult the following servers: For submission of APPROX papers: http://www.easychair.org/conferences/?conf=approx11 For submission of RANDOM papers: http://www.easychair.org/conferences/?conf=random11 Note: You will be asked to login using an EasyChair account. Directions on how to register for such an account are available at the submission servers (you may also have an old account from a previous conference submission). The submission must be received by 17:00pm (PDT) of April 15 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 (not including the references). 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. Simultaneous submission Simultaneous submission to other conferences with published proceedings is not allowed. PROCEEDINGS 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, 4110 and 4627 while previous proceedings of RANDOM appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624, 4110, 4627 and as Proceedings in Informatics 8. IMPORTANT DATES Submissions: April 15 Notifications: June 8 Camera ready: June 17 PROGRAM COMMITTEES Approx Julia Chuzoy, Toyota Technological Institute at Chicago Naveen Garg, IIT Delhi Michel Goemans, MIT Fabrizio Grandoni, University of Roma - Tor Vergata Anupam Gupta, Carnegie Mellon University Prahalad Harsha, Tata Institute of Fundamental Research, Mumbai Satoru Iwata, Research Institute for Mathematical Sciences, Kyoto Philip Klein, Brown University Robert Krauthgammer, The Weizmann Institute of Science Kamesh Munagala, Duke University Zeev Nutov, The Open University of Israel R. Ravi, Carnegie Mellon University (chair) Guido Schaefer, CWI and VU University Amsterdam Chaitanya Swamy, University of Waterloo Kunal Talwar, Microsoft Research Silicon Valley Gerhard Woeginger, Eindhoven University of Technology Random Per Austrin, University of Toronto Nayantara Bhatnagar, Hebrew University of Jerusalem Amin Coja-Oghlan, University of Warwick Josep Diaz, Universitat Politecnica Catalunya Benjamin Doerr, MPI Saarbrucken Devdatt Dubhashi, Chalmers University Martin Dyer, University of Leeds Tom Friedetzky, University of Durham Leslie Goldberg, University of Liverpool (PC chair) Mark Jerrum, Queen Mary, University of London Elitza Maneva, University of Barcelona Allan Sly, Microsoft Research Eli Upfal, Brown University Juan Vera, University of Tilburg Osamu Watanabe, Tokyo Institute of Technology David Zuckerman, University of Texas PROGRAM CHAIRS R. Ravi, Carnegie Mellon University Leslie Goldberg, University of Liverpool Workshop Chairs Jose Rolim, University of Geneva Klaus Jansen, University of Kiel CONFERENCE WEB PAGE http://cui.unige.ch/tcs/random-approx/