RANDOM 2018 - The 22nd International Conference on Randomization and
APPROX 2018 - The 21st International Conference on Approximation
Algorithms for Combinatorial Optimization Problems
20-22 August, 2018
Princeton University, New Jersey
Submissions: April 20, 2018
Notifications: June 1, 2018
Camera ready: June 11, 2018
The 22nd International Conference on Randomization and Computation
(RANDOM'2018) and the 21st International Conference on Approximation
Algorithms for Combinatorial Optimization Problems (APPROX'2018) will be
held on August 20-22, 2018 at Princeton University, New Jersey.
RANDOM'2018 focuses on applications of randomness to computational and
combinatorial problems while APPROX'2018 focuses on algorithmic and
complexity theoretic issues relevant to the development of efficient
approximate solutions to computationally difficult problems.
Papers are solicited in all research areas related to randomization and
approximation, including but not limited to:
* 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
* Smoothed analysis
* Property testing
* Computational learning theory
* 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
* Algorithmic game theory and economics
* Computational geometric problems
* Approximate learning
* Online algorithms
* Approaches that go beyond worst-case analysis
* Other applications
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
For submission of RANDOM papers:
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
The submission must be received by 15:00pm (PDT) of April 20th for your
submission to be considered.
Submission Format: Submissions 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 on single-spaced pages on
letter-size paper, using reasonable margins and at least 11-point font.
The first 10 pages should contain the main ideas and techniques used to
achieve the results including motivation and a clear comparison with
related work (not including the references). There is no page limit but
any material beyond the first 10 pages will be read at the sole
discretion of the program committee. Simultaneous submission to other
conferences with published proceedings is not allowed.
Accepted papers will be published in the online proceedings of the
conference in the Leibniz International Proceedings in Informatics
(LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial,
free and easy electronic access, while the authors retain the rights
over their work. Further detail will be available early January at the
conference website. 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, and as Proceedings in Informatics 8.
University of Waterloo, Canada
Cornell University, USA
José Rolim - University of Geneva
Klaus Jansen - University of Kiel
Eric Blais U. Waterloo
Joshua Brody Swarthmore College
Xi Chen Columbia U.
Gil Cohen Princeton and Tel Aviv U.
Andrew Drucker U. Chicago
Tom Gur UC Berkeley
Daniel Kane UCSD
Pravesh Kothari Princeton U. and IAS
Reut Levi Weizmann Institute
Aleksandar Nikolov U. Toronto
Lev Reyzin U. Illinois Chicago
Noga Ron-Zewi Haifa U.
Ron Rosenthal Technion
Atri Rudra U. Buffalo
Or Sheffet U. Alberta
Thomas Watson U. Memphis
Yuichi Yoshida NII
Parinya Chalermsook Aalto U.
Alina Ene BU
Fabrizio Grandoni IDSIA
Anupam Gupta CMU
Pravesh Kothari Princeton U. and IAS
Lap Chi Lau U. Waterloo
Euiwoong Lee Simons Institute
James Lee UW
Edo Liberty Amazon
Yury Makarychev TTI
Neil Olver Amsterdam U.
Yuval Rabani HUJI
Tselil Schramm Harvard and MIT
Roy Schwartz Technion
Noah Stephens-Davidowitz Princeton U.
David Steurer ETH
Inbal Talgam-Cohen HUJI
Aravindan Vijayaraghavan Northwestern U.
Justin Ward Queens Mary U.
Tony Wirth Melbourne U.
Grigory Yaroslavtsev U. Indiana
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)