Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007. Proceedings PDF
Preview Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007. Proceedings
Lecture Notes in Computer Science 4627 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen UniversityofDortmund,Germany MadhuSudan MassachusettsInstituteofTechnology,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA MosheY.Vardi RiceUniversity,Houston,TX,USA GerhardWeikum Max-PlanckInstituteofComputerScience,Saarbruecken,Germany Moses Charikar Klaus Jansen Omer Reingold José D.P. Rolim (Eds.) Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques 10th InternationalWorkshop,APPROX 2007 and 11th InternationalWorkshop, RANDOM 2007 Princeton, NJ, USA,August 20-22, 2007 Proceedings 1 3 VolumeEditors MosesCharikar PrincetonUniversity ComputerScienceDept. 35OldenStreet,Princeton,NJ08540-5233,USA E-mail:[email protected] KlausJansen UniversityofKiel InstituteforComputerScience OlshausenerStr.40,24098Kiel,Germany E-mail:[email protected] OmerReingold TheWeizmannInstituteofScience FacultyofMathematicsandComputerScience Rehovot76100,Israel E-mail:[email protected] JoséD.P.Rolim CentreUniversitaired’Informatique BattellebâtimentA routedeDrize7,1227Carouge,Geneva,Switzerland E-mail:[email protected] LibraryofCongressControlNumber:2007932294 CRSubjectClassification(1998):F.2,G.2,G.1 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ISSN 0302-9743 ISBN-10 3-540-74207-7SpringerBerlinHeidelbergNewYork ISBN-13 978-3-540-74207-4SpringerBerlinHeidelbergNewYork Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. SpringerisapartofSpringerScience+BusinessMedia springer.com ©Springer-VerlagBerlinHeidelberg2007 PrintedinGermany Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SPIN:12106011 06/3180 543210 Preface This volume contains the papers presented at the 10th International Work- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2007) and the 11th International Workshop on Randomization and Computation (RANDOM 2007), which took place concurrently at Princeton University, on August 20–22, 2007. APPROX focuses on algorithmic and com- plexity issues surrounding the development of efficient approximate solutions to computationally difficult problems, and this was the 10th in the series after Aalborg (1998), Berkeley (1999), Saarbru¨cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), and Barcelona (2006). RANDOM is concerned with applications of randomness to computa- tionalandcombinatorialproblems,andthis wasthe 11thworkshopinthe series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley(2001),Harvard(2002),Princeton(2003),Cambridge(2004),Berkeley (2005), and Barcelona (2006). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms,sub-linear time algorithms,embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network designandrouting,packingandcovering,scheduling,designandanalysisofran- domized algorithms, randomized complexity theory, pseudorandomness and de- randomization,randomcombinatorialstructures,randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, ran- dom projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of ap- proximation and randomness. The volume contains 21 contributed papers, selected by the APPROX Pro- gram Committee out of 49 submissions, and 23 contributed papers, selected by the RANDOM ProgramCommittee out of 50 submissions. We would like to thank all of the authors who submitted papers and the members of the ProgramCommittees: APPROX 2007 Nikhil Bansal, IBM T J Watson Moses Charikar, Princeton University (chair) Chandra Chekuri, University of Illinois, Urbana-Champaign Julia Chuzhoy, IAS Venkatesan Guruswami, University of Washington Howard Karloff, AT&T Labs Research Guy Kortsarz,Rutgers, Camden VI Preface Robert Krauthgamer,IBM Almaden Claire Mathieu, Brown University Seffi Naor, Microsoft Research and Technion Chaitanya Swamy, University of Waterloo Lisa Zhang, Bell Labs RANDOM 2007 Irit Dinur, Hebrew University Thomas Hayes, Toyota TechnologicalInstitute at Chicago Piotr Indyk, MIT Russell Martin, University of Liverpool Dieter van Melkebeek, University of Wisconsin, Madison Michael Mitzenmacher, Harvard University Michael Molloy, University of Toronto Cristopher Moore, University of New Mexico Sofya Raskhodnikova,Penn State University Omer Reingold, Weizmann Institute (chair) Ronen Shaltiel, University of Haifa Asaf Shapira, Microsoft Research Aravind Srinivasan, University of Maryland Angelika Steger, ETH Zu¨rich Emanuele Viola, IAS We would also like to thank the external subreferees: Scott Aaronson, Dim- itris Achlioptas, Nir Ailon, Gorjan Alagic, Christoph Ambu¨hl, Matthew An- drews, Arash Asadpour, Ziv Bar-Yossef, Petra Berenbrink, Nicla Bernasconi, AndrejBogdanov,NivBuchbinder,SouravChakraborty,Ho-LeungChan,Aaron Clauset, Anne Condon, Artur Czumaj, Varsha Dani, Aparna Das, Roee Engel- berg, Eldar Fischer, Abraham Flaxman, Tom Friedetzky, Rajiv Gandhi, Leszek Gasieniec, Daniel Golovin, Ronen Gradwohl, Anupam Gupta, Dan Gutfreund, (cid:2) MagnusM.Halldorsson,PrahladhHarsha,GaborIvanyos,MarkJerrum,Valen- tine Kabanets, Shiva Kasiviswanathan, Jonathan Katz, Neeraj Kayal, David Kempe,RohitKhandekar,SanjeevKhanna,LefterisKirousis,PhilKlein,Jochen Konemann,RomanKotecky,RobertKrauthgamer,MichaelKrivelevich,Fabian Kuhn,EyalKushilevitz,EmmanuelleLebhar,MichaelLandberg,RonLavi,Liane Lewin-Eytan,AvnerMagen,MartinMarciniszyn,FrankMcSherry,JulianMestre, VahabS.Mirrokni,TorstenMuetze,AshwinNayak,OferNeiman,IlanNewman, Zeev Nutov, Konstantinos Panagiotou, Rina Panigrahy, Konstantin Pervyshev, Boris Pittel, Yuval Rabani, Prasad Raghavendra, Rajmohan Rajaraman, Dror Rawitz,DanielReichman,DanaRon,EyalRozenman,AlexRussell,JaredSaia, Mohammad R Salavatipour, Alex Samorodnitsky, Rahul Santhanam, Warren Schudy, Justus Schwartz, Roy Schwartz, Amir Shpilka, Nikolai Simonov, Adam Smith, Joel Spencer, Reto Sp¨ohel, Venkatesh Srinivasan, Mukund Sundarara- jan, Maxim Sviridenko, Jan Vondrak, John Watrous, Ryan Williams, David Preface VII Williamson,PrudenceWong,OrlyYahalom,SergeyYekhanin,NealYoung,and Michele Zito. We gratefully acknowledge the support from the Department of Computer Science at the Princeton University, the Faculty of Mathematics and Computer Science ofthe WeizmannInstitute ofScience,the Institute ofComputerScience oftheChristian-Albrechts-Universit¨atzuKielandtheDepartmentofComputer Science of the University of Geneva. August 2007 Moses Charikar and Omer Reingold, ProgramChairs Klaus Jansen and Jos´e D. P. Rolim, Workshop Chairs Table of Contents Contributed Talks of APPROX Approximation Algorithms and Hardness for Domination with Propagation..................................................... 1 Ashkan Aazami and Michael D. Stilp A Knapsack Secretary Problem with Applications.................... 16 Moshe Babaioff, Nicole Immorlica, David Kempe, and Robert Kleinberg An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem ........................... 29 Jaroslaw Byrka Improved Approximation Algorithms for the Spanning Star Forest Problem ........................................................ 44 Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, and Gyanit Singh Packing and Covering δ-Hyperbolic Spaces by Balls .................. 59 Victor Chepoi and Bertrand Estellon Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems.................................................. 74 Ilias Diakonikolas and Mihalis Yannakakis Two Randomized Mechanisms for Combinatorial Auctions ............ 89 Shahar Dobzinski Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs ......................................... 104 Uriel Feige and Mohit Singh Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows..................... 119 Greg N. Frederickson and Barry Wittman Stochastic Steiner Tree with Non-uniform Inflation ................... 134 Anupam Gupta, MohammadTaghi Hajiaghayi, and Amit Kumar On the Approximation Resistance of a Random Predicate............. 149 Johan H˚astad X Table of Contents Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to (cid:3) Embeddability of Negative Type Metrics .............. 164 1 Hamed Hatami, Avner Magen, and Evangelos Markakis Optimal Resource Augmentations for Online Knapsack ............... 180 Kazuo Iwama and Guochuan Zhang Soft Edge Coloring............................................... 189 Chadi Kari, Yoo-Ah Kim, Seungjoon Lee, Alexander Russell, and Minho Shin Approximation Algorithms for the Max-Min Allocation Problem ....... 204 Subhash Khot and Ashok Kumar Ponnuswami Hardness of Embedding Metric Spaces of Equal Size.................. 218 Subhash Khot and Rishi Saket Coarse Differentiation and Multi-flows in Planar Graphs .............. 228 James R. Lee and Prasad Raghavendra Maximum Gradient Embeddings and Monotone Clustering ............ 242 Manor Mendel and Assaf Naor Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems................................................ 257 Viswanath Nagarajan and R. Ravi Encouraging Cooperation in Sharing Supermodular Costs ............. 271 Andreas S. Schulz and Nelson A. Uhan Almost Exact Matchings.......................................... 286 Raphael Yuster Contributed Talks of RANDOM On Approximating the Average Distance Between Points ............. 296 Kfir Barhum, Oded Goldreich, and Adi Shraibman On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR ............................................................ 311 Omer Barkol, Yuval Ishai, and Enav Weinreb A Sequential Algorithm for Generating Random Graphs .............. 326 Mohsen Bayati, Jeong Han Kim, and Amin Saberi Local Limit Theorems for the Giant Component of Random Hypergraphs .................................................... 341 Michael Behrisch, Amin Coja-Oghlan, and Mihyun Kang Table of Contents XI Derandomization of Euclidean Random Walks ....................... 353 Ilia Binder and Mark Braverman High Entropy Random Selection Protocols .......................... 366 Harry Buhrman, Matthias Christandl, Michal Kouck´y, Zvi Lotker, Boaz Patt-Shamir, and Nikolai Vereshchagin Testing st-Connectivity ........................................... 380 Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, and Ilan Newman Properly 2-Colouring Linear Hypergraphs........................... 395 Arkadev Chattopadhyay and Bruce A. Reed Random Subsets of the Interval and P2P Protocols................... 409 Jacek Cichon´, Marek Klonowski, L(cid:3) ukasz Krzywiecki, Bart(cid:3)lomiej Ro´z˙an´ski, and Pawe(cid:3)l Zielin´ski The Cover Time of Random Digraphs .............................. 422 Colin Cooper and Alan Frieze Eigenvectors of Random Graphs: Nodal Domains .................... 436 Yael Dekel, James R. Lee, and Nathan Linial Lower Bounds for Swapping Arthur and Merlin ...................... 449 Scott Diehl Lower Bounds for Testing Forbidden Induced Substructures in Bipartite-Graph-Like Combinatorial Objects ........................ 464 Eldar Fischer and Eyal Rozenberg On Estimating Frequency Moments of Data Streams ................. 479 Sumit Ganguly and Graham Cormode Distribution-Free Testing Lower Bounds for Basic Boolean Functions ... 494 Dana Glasner and Rocco A. Servedio On the Randomness Complexity of Property Testing ................. 509 Oded Goldreich and Or Sheffet On the Benefits of Adaptivity in Property Testing of Dense Graphs .... 525 Mira Gonen and Dana Ron Slow Mixing of Markov Chains Using Fault Lines and Fat Contours .... 540 Sam Greenberg and Dana Randall Better Binary List-Decodable Codes Via Multilevel Concatenation ..... 554 Venkatesan Guruswami and Atri Rudra Worst-Case to Average-Case Reductions Revisited ................... 569 Dan Gutfreund and Amnon Ta-Shma XII Table of Contents On Finding Frequent Elements in a Data Stream..................... 584 Ravi Kumar and Rina Panigrahy Implementing Huge Sparse Random Graphs ......................... 596 Moni Naor and Asaf Nussboim Sublinear Algorithms for Approximating String Compressibility........ 609 Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, and Adam Smith Author Index.................................................. 625
Description:The list of books you might like
