Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings PDF
Preview Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings
Lecture Notes in Computer Science 7408 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA AlfredKobsa UniversityofCalifornia,Irvine,CA,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen TUDortmundUniversity,Germany MadhuSudan MicrosoftResearch,Cambridge,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA GerhardWeikum MaxPlanckInstituteforInformatics,Saarbruecken,Germany Anupam Gupta Klaus Jansen José Rolim Rocco Servedio (Eds.) Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques 15th International Workshop,APPROX 2012 and 16th International Workshop, RANDOM 2012 Cambridge, MA, USA,August 15-17, 2012 Proceedings 1 3 VolumeEditors AnupamGupta CarnegieMellonUniversity DepartmentofComputerScience 7203GatesBuilding,Pittsburgh,PA15213,USA E-mail:[email protected] KlausJansen UniversityofKiel DepartmentofComputerScience Olshausenstraße40,24098Kiel,Germany E-mail:[email protected] JoséRolim UniversityofGeneva CentreUniversitaired’Informatique BattelleBatA,7routedeDrize,1227Carouge,Switzerland E-mail:[email protected] RoccoServedio ColumbiaUniversity DepartmentofComputerScience FoundationSchoolofEngineeringandAppliedScience 1214AmsterdamAvenue,10027-7003NewYork,NY,USA E-mail:[email protected] ISSN0302-9743 e-ISSN1611-3349 ISBN978-3-642-32511-3 e-ISBN978-3-642-32512-0 DOI10.1007/978-3-642-32512-0 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:2012943609 CRSubjectClassification(1998):F.2.2,G.2.2,G.2.1,F.1.2,G.1.0,G.1.2,G.1.6,G.3 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©Springer-VerlagBerlinHeidelberg2012 Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply, evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws andregulationsandthereforefreeforgeneraluse. Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Preface This volume contains the papers presented at the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems(APPROX 2012) and the 16th International Workshop on Random- ization and Computation (RANDOM 2012), which took place concurrently at the Massachusetts Institute of Technology, USA, during August 15–17,2012. APPROX focuses on algorithmic and complexity issues surrounding the de- velopment of efficient approximate solutions to computationally difficult prob- lems, and was the 15th in the series after Aalborg (1998), Berkeley (1999), Saarbru¨cken(2000),Berkeley(2001),Rome(2002),Princeton(2003),Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), Boston (2008), Berkeley (2009), Barcelona (2010), and Princeton (2011). RANDOM is con- cerned with applications of randomness to computational and combinatorial problems, and was the 16th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002),Princeton(2003),Cambridge(2004),Berkeley(2005),Barcelona(2006), Princeton (2007), Boston (2008), Berkeley (2009), Barcelona (2010), Princeton (2011). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space algorithms, sub-linear time algorithms,streaming algorithms,embeddings and metric space methods,mathematicalprogrammingmethods,combinatorialproblemsingraphs andnetworks,gametheory,marketsandeconomicapplications,geometricprob- lems, packing, covering, scheduling, approximate learning, design and analysis of online algorithms,designand analysis ofrandomizedalgorithms,randomized complexitytheory,pseudorandomnessandderandomization,randomcombinato- rialstructures,randomwalks/Markovchains, expander graphsand randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of approximation and randomness. The volume contains 28 contributed papers, selected by the APPROX Pro- gram Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM ProgramCommittee out of 67 submissions. We would like to thank all of the authors who submitted papers, the invited speakers,the members of the ProgramCommittees, and the external reviewers. We gratefully acknowledge the support from the Department of Computer Science at the Carnegie Mellon University, USA, the Department of Computer Science at the Columbia University, the Institute of Computer Science of the Christian-Albrechts-Universit¨at zu Kiel, and the Department of Computer Sci- ence of the University of Geneva. VI Preface We warmly thank Joanne Talbot and Ronitt Rubenfeld from the MIT Computer Science and Artificial Intelligence Laboratory for all the help and support.We alsowouldlike to thank MicrosoftResearch- New Englandfor the partial sponsorship of this conference. Finally, many thanks to Parvaneh Karimi-Massouleh for editing the proceedings. August 2012 Anupam Gupta Rocco Servedio Klaus Jansen Jos´e D.P. Rolim Organization Program Committees APPROX 2012 Alexandr Andoni Microsoft Research Silicon Valley, USA Yossi Azar Blavatnik School of Computer Science, Israel Shuchi Chawla University of Wisconsin, Madison Anupam Gupta Carnegie Mellon University (Chair), USA Sariel Har-Peled University of Illinois, USA Jochen Koenemann University of Waterloo, Canada Amit Kumar Indian Institute of Technology, India Lap Chi Lau Chinese University of Hong Kong, Hong Kong Konstantin Makarychev Microsoft Research, USA Monaldo Mastrolilli IDSIA, Switzerland Dana Moshkovitz Massachusetts Institute of Technology, USA Rene Sitters Vrije Universiteit, The Netherlands David Steurer Microsoft Research, USA Kunal Talwar Microsoft Research Silicon Valley, USA Jan Vondrak IBM Almadan Research Center, USA Lisa Zhang Bell Laboratories, USA RANDOM 2012 Eli Ben-Sasson Technion-Israel Institute of Technology, Israel Andrej Bogdanov Chinese University of Hong Kong, Hong Kong Mark Braverman University of Toronto, Canada Colin Cooper King’s College London, UK Tobias Friedrich Saarland University, Germany Tali Kaufman Bar Ilan University, Israel Raghu Meka Institute for Advanced Study, Princeton, USA Jelani Nelson Princeton University, USA Ilan Newman University of Haifa, Israel Ryan O’Donnell Carnegie Mellon University,USA Konstantinos Panagiotou Max-Planck-Institut fu¨r informatik, Germany PrasadRaghavendra Georgia Institute of Technology, USA Atri Rudra University of Buffalo, USA Rocco Servedio (Chair) Columbia University, USA Alistair Sinclair University of California, USA Emanuele Viola Northeastern University, USA VIII Organization External Reviewers Mohammed Abdullah Zachary Friggstad Rajsekar Manokaran Dimitris Achlioptas Stanley P. Y. Fung Bodo Manthey Noga Alon Ariel Gabizon Arie Matsliah Hyung-Chan An Iftah Gamzu Pierre McKenzie Per Austrin Naveen Garg Moti Medina Nikhil Bansal Luisa Gargano Or Meir Siddharth Barman William Gasarch Julian Mestre Avi Ben-Aroya Konstantinos Georgiou Joel Miller Arnab Bhattacharyya Shayan Oveis Gharan Carsten Moldenhauer Eric Blais Parikshit Gopalan Ben Moseley Andrej Bogdanov Venkat Guruswami Viswanath Nagarajan Graham Brightwell Iftach Haitner Meghana Nasre Karl Bringmann Tobias Harks Amir Nayyeri Andrei Bulatov Prahladh Harsha Chrystopher Nehaniv K. Chandrasekaran Frank Hellweg Zeev Nutov Deeparnab Chakrabarty Sungjin Im Krzysztof Onak Tanmoy Chakraborty Piotr Indyk Shayan Oveis Gharan Parinya Chalermosook Rahul Jain Renato Paes-Leme Ho-Leung Chan Klaus Jansen Denis Pankratov Chandra Chekuri Mark Jerrum Britta Peis Joseph Cheriyan Lukasz Jez Eric Price Eden Chlamtac Michael Kapralov Prasad Raghavendra Sung-Soon Choi Mark Keil Rajmohan Rajaraman Giorgos Christodoulou Rohit Khandekar R. Ravi Edith Cohen Shiva Kintali Ben Recht Gil Cohen Hartmut Klauck Oded Regev Ilan Cohen Lasse Kliemann Dana Ron Marek Cygan Ranganath Kondapally Benjamin Rossman Artur Czumaj Michael Krivelevich Guy Rothblum Anindya De Amit Kumar Barna Saha Ilias Diakonikolas Tsz Chiu Kwok Rishi Saket Irit Dinur Oded Lachish Alex Samorodnitsky Yevgeniy Dodis Huy Le Nguyen Shubhangi Saraf Benjamin Doerr Troy Lee Guido Schaefer Zeev Dvir Johannes Lengler Gil Segev Jeff Edmonds Stefano Leonardi Sandeep Sen Amir Epstein Reut Levi Ronen Shaltiel Dan Feldman Xin Li Yaoyun Shi Jon Feldman Henry Lin Amir Shpilka Cristina Fernandes Shachar Lovett Brad Shutters David Fernandez-Baca Mohammad Mahdian Yiannis Siantos Eldar Fischer Yury Makarychev Mohit Singh Fedor Fomin Tal Malkin Allan Sly Organization IX Reto Spohel Sergei Vassilvitskii Dachuan Xu Aravind Srinivasan Laszlo Vegh Li Yan Rob van Stee Jose’ Verschae Qiqi Yan Daniel Stefankovic A. Vijayaraghavan Grigory Yaroslavtsev Martin Strauss Pascal Vontobel Yuichi Yoshida He Sun Andrew Wan Qin Zhang Tami Tamir Carol Wang Yuan Zhou Li-Yang Tan David Williamson David Zuckerman Madhur Tulsiani Karl Wimmer Jonathan Ullman Carola Winzen Seeun Umboh Ning Xie Table of Contents Contributed Talks of APPROX A New Point of NP-Hardness for 2-to-1 Label Cover.................. 1 Per Austrin, Ryan O’Donnell, and John Wright Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems................................................. 13 Per Austrin, Toniann Pitassi, and Yu Wu Additive Approximation for Near-Perfect Phylogeny Construction...... 25 Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, and Or Sheffet Improved Spectral-Norm Bounds for Clustering...................... 37 Pranjal Awasthi and Or Sheffet Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs.......................................... 50 Piotr Berman and Grigory Yaroslavtsev What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid ........................................................ 61 Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, and Martin J. Strauss Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply ........................................... 73 Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, and Sanjeev Khanna Online Flow Time Scheduling in the Presence of Preemption Overhead ....................................................... 85 Ho-Leung Chan, Tak-Wah Lam, and Rongbin Li Prize-Collecting Survivable Network Design in Node-Weighted Graphs ......................................................... 98 Chandra Chekuri, Alina Ene, and Ali Vakilian Approximating Minimum-Cost Connected T-Joins ................... 110 Joseph Cheriyan, Zachary Friggstad, and Zhihan Gao iBGP and Constrained Connectivity................................ 122 Michael Dinitz and Gordon Wilfong
Description:The list of books you might like
