<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<font face="Times New Roman">Hi Klaus</font><br>
<br>
I hope everything is fine with you. Could you broadcast this as a
preliminary cfp in the usual sites?<br>
<br>
Thanks a lot and best regards<br>
<br>
Jose<br>
<br>
<br>
--------------------------------------------------------------------------------------------<br>
<br>
APPROX 2012 and RANDOM 2012<br>
<br>
15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012<br>
16th Intl. Workshop on Randomization and Computation - RANDOM 2012<br>
<br>
<a class="moz-txt-link-freetext" href="http://cui.unige.ch/tcs/random-approx/">http://cui.unige.ch/tcs/random-approx/</a><br>
<br>
Aug. 15-17, 2012<br>
<br>
M.I.T.<br>
<br>
Call for papers<br>
<br>
<br>
SCOPE<br>
<br>
15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012<br>
<br>
16th Intl. Workshop on Randomization and Computation - RANDOM 2012<br>
<br>
The 15th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2012) and the 16th.
International Workshop on Randomization and Computation
(RANDOM'2012) will be held on 15-17 August 2012 at M.I.T.<br>
APPROX'2012 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2012 focus on
applications of randomness to computational and combinatorial
problems. RANDOM'2012 is the sixteenth workshop in the series;
APPROX'2012 is the fifteenth in the series.<br>
<br>
TOPICS<br>
<br>
Papers are solicited in all research areas related to randomization
and approximation, including, but not limited to:<br>
<br>
APPROX<br>
<br>
design and analysis of approximation<br>
algorithms<br>
hardness of approximation<br>
small space, sub-linear time, and<br>
streaming algorithms<br>
embeddings and metric space methods<br>
mathematical programming methods<br>
combinatorial problems in graphs and<br>
networks<br>
game theory, markets, and economic<br>
applications<br>
geometric problems<br>
packing, covering, and scheduling<br>
approximate learning<br>
other applications<br>
<br>
RANDOM<br>
<br>
design and analysis of randomized<br>
algorithms<br>
randomized complexity theory<br>
pseudorandomness and derandomization<br>
random combinatorial structures<br>
random walks/Markov chains<br>
expander graphs and randomness extractors<br>
probabilistic proof systems<br>
random projections and embeddings<br>
error-correcting codes<br>
average-case analysis<br>
property testing<br>
computational learning theory<br>
<br>
SUBMISSIONS<br>
<br>
Submissions must be received by 17:00pm (EDT) of April 20 at:<br>
<a class="moz-txt-link-freetext" href="http://cui.unige.ch/tcs/random-approx/">http://cui.unige.ch/tcs/random-approx/</a><br>
in order to be considered.<br>
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.<br>
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.<br>
Simultaneous submission to other conferences with published
proceedings is not allowed.<br>
<br>
<br>
PROCEEDINGS<br>
<br>
Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.<br>
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.<br>
<br>
IMPORTANT DATES<br>
<br>
Submissions: April 20, 2012<br>
Notifications: June 8, 2012<br>
Camera ready: June 18, 2012<br>
<br>
PROGRAM COMMITTEES<br>
<br>
Approx<br>
<br>
Alexandr Andoni (Microsoft Research SVC)<br>
Yossi Azar (Tel-Aviv University)<br>
Shuchi Chawla (University of Wisconsin - Madison)<br>
Anupam Gupta (Carnegie Mellon University, chair)<br>
Sariel Har-Peled (University of Illinois at Urbana-Champaign)<br>
Jochen Koenemann (University of Waterloo)<br>
Amit Kumar (Indian Institute of Technology, Delhi)<br>
Lap Chi Lau (The Chinese University of Hong Kong)<br>
Konstantin Makarychev (IBM Watson)<br>
Monaldo Mastrolilli (IDSIA)<br>
Dana Moshkovitz (MIT)<br>
Rene Sitters (Vrije Universiteit Amsterdam)<br>
David Steurer (Microsoft Research and Cornell)<br>
Kunal Talwar (Microsoft Research SVC)<br>
Jan Vondrak (IBM Almaden)<br>
Lisa Zhang (Alcatel-Lucent Bell Labs)<br>
<br>
Random<br>
<br>
Eli Ben-Sasson (Technion)<br>
Andrej Bogdanov (Chinese University of Hong Kong)<br>
Mark Braverman (Princeton)<br>
Colin Cooper (King's College, London)<br>
Tobias Friedrich (Saarland University / Max-Planck-Institut)<br>
Tali Kaufman (Bar-Ilan University / Weizmann Institute of Science)<br>
Raghu Meka (Institute for Advanced Study)<br>
Jelani Nelson (Princeton)<br>
Ilan Newman (University of Haifa)<br>
Ryan O'Donnell (Carnegie Mellon University)<br>
Konstantinos Panagiotou (Max-Planck-Institut)<br>
Prasad Raghavendra (Georgia Tech)<br>
Atri Rudra (University at Buffalo, SUNY)<br>
Rocco Servedio (Columbia, chair)<br>
Alistair Sinclair (UC Berkeley)<br>
Emanuele Viola (Northeastern)<br>
<br>
<br>
PROGRAM CHAIRS<br>
<br>
APPROX<br>
Anupam Gupta, Carnegie Mellon University <br>
<br>
<br>
RANDOM<br>
Rocco Servedio, Columbia University<br>
<br>
<br>
<br>
WORKSHOP CHAIRS<br>
<br>
Jose Rolim, U. of Geneva<br>
Klaus Jansen, U. of Kiel<br>
<br>
CONFERENCE WEB PAGE<br>
<br>
<a class="moz-txt-link-freetext" href="http://cui.unige.ch/tcs/random-approx/">http://cui.unige.ch/tcs/random-approx/</a><br>
<br>
<br>
----------------------------------------------------------------------------------<br>
<pre class="moz-signature" cols="72">-</pre>
</body>
</html>