APPROX 2017: 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems Berkeley, CA, United States, August 16-18, 2017 |
Conference website | http://cui.unige.ch/tcs/random-approx/2017/index.php |
Submission link | https://easychair.org/conferences/?conf=approx2017 |
Submission deadline | April 21, 2017 |
APPROX 2017 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.
Submission Guidelines
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.
List of Topics
- 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
Committees
Program Committee
- Nikhil Bansal (Eindhoven)
- Siu On Chan (CUHK)
- Moses Charikar (Stanford)
- Michel Goemans (MIT)
- Venkatesan Guruswami (CMU)
- Sungjin Im (UC Merced)
- Sanjeev Khanna (U Penn)
- Jochen Koenemann (Waterloo)
- Shi Li (Buffalo)
- Nicole Megow (Bremen)
- Viswanath Nagarajan (Michigan)
- Laura Sanità (Waterloo)
- Ola Svensson (EPFL)
- Seeun William Umboh (Eindhoven)
- David Williamson, Chair (Cornell)
- Anke van Zuylen (William and Mary)
Organizing committee
- Local organizer: Neha Dave, Berkeley, CA
- José Rolim (Geneva)
- Klaus Jansen (Kiel)
Publication
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, 4627 and as Proceedings in Informatics 8.
Venue
The conference will be held at UC Berkeley, California.
Contact
All questions about submissions should be emailed to davidpwilliamson@cornell.edu.