Approximation and Online Algorithms: 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers PDF
Preview Approximation and Online Algorithms: 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers
Laura Sanità Martin Skutella (Eds.) 9 9 Approximation 4 9 S C and Online Algorithms N L 13th International Workshop, WAOA 2015 Patras, Greece, September 17–18, 2015 Revised Selected Papers 123 Lecture Notes in Computer Science 9499 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 à Laura Sanit Martin Skutella (Eds.) (cid:129) Approximation and Online Algorithms 13th International Workshop, WAOA 2015 – Patras, Greece, September 17 18, 2015 Revised Selected Papers 123 Editors Laura Sanità Martin Skutella University of Waterloo Technische UniversitätBerlin Waterloo Berlin Canada Germany ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-319-28683-9 ISBN978-3-319-28684-6 (eBook) DOI 10.1007/978-3-319-28684-6 LibraryofCongressControlNumber:2015958903 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerInternationalPublishingSwitzerland2015 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade. Printedonacid-freepaper ThisSpringerimprintispublishedbySpringerNature TheregisteredcompanyisSpringerInternationalPublishingAGSwitzerland Preface The13thWorkshoponApproximationandOnlineAlgorithms(WAOA2015)focused on the design and analysis of approximation and online algorithms. These algorithms have become a fundamental tool in several fields and in many applications that cope with computationally hard problems and problems in which the input is gradually disclosed over time. WAOA 2015 took place in Patras (Greece) during September 17–18, 2015, and it was part of ALGO 2015, which also hosted ESA, ALGOCLOUD, ALGOSENSORS, ATMOS, IPEC, and MASSIVE. The previous WAOA workshops were held in Budapest(2003),Rome(2004),PalmadeMallorca(2005),Zurich(2006),Eilat(2007), Karlsruhe (2008), Copenhagen (2009), Liverpool (2010), Saarbrücken (2011), Ljubljana(2012),SophiaAntipolis(2013),andWraclaw(2014).Theproceedingsofall these previous WAOA workshops have been published as LNCS volumes. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability,mechanismdesign,naturalalgorithms,networkdesign,packingand covering, paradigms for the design and analysis of approximation and online algo- rithms, parameterized complexity, scheduling problems, and real-world applications. In response to the call for papers, we received 40 submissions, one of which was subsequentlywithdrawn.Eachsubmissionwasreviewedbyatleastthreereferees,and mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 17 papers. This volume contains final revised versions of these papers. We would like to thank all the authors who submitted papers to WAOA 2015, and our plenary invited speaker Jochen Könemann for accepting our invitation. Further- more, we are extremely grateful to the members of the Organizing Committee and its chair, Christos Zaroliagis, for doing a superb job with organizing ALGO 2015. October 2015 Laura Sanità Martin Skutella Organization Program Committee Leah Epstein University of Haifa, Israel Samuel Fiorini Université Libre de Bruxelles, Belgium Zachary Friggstad University of Alberta, Canada Anupam Gupta Carnegie Mellon University, USA Lap Chi Lau University of Waterloo, Canada Nicole Megow Technische Universität München, Germany Marco Molinaro TU Delft, The Netherlands Britta Peis RWTH Aachen University, Germany Thomas Rothvoss University of Washington, Seattle, USA Laura Sanità University of Waterloo, Canada Jiří Sgall Charles University, Prague, Czech Republic Martin Skutella Technische Universität Berlin, Germany José Soto Universidad de Chile, Chile Kavitha Telikepalli Tata Institute of Fundamental Research, Mumbai, India Andreas Wiese Max Planck Institute for Informatics, Germany David Williamson Cornell University, USA Gerhard Woeginger TU Eindhoven, The Netherlands Paul Wollan University of Rome, Italy Rico Zenklusen ETH Zürich, Switzerland Additional Reviewers Abdi, Ahmad Dósa, György Adamaszek, Anna Erlebach, Thomas Adjiashvili, David Fekete, Sándor Al-Bawani, Kamal Folwarczný, Lukáš Antoniadis, Antonios Galanis, Andreas Azar, Yossi Gottschalk, Corinna Batra, Jatin Gupta, Manoj Boyar, Joan Han, Xin Bruhn, Henning Heydrich, Sandy Büsing, Christina Imreh, Csanad Cardinal, Jean Jerrum, Mark Chalermsook, Parinya Klimm, Max Chestnut, Steve Kwok, Tsz Chiu Chrobak, Marek Künnemann, Marvin De Keijzer, Bart Lokshtanov, Daniel VIII Organization Matuschke, Jannik Sviridenko, Maxim Mömke, Tobias Tiedemann, Morten Niazadeh, Rad Tönnis, Andreas Pruhs, Kirk Uetz, Marc V. Pérez-Lantero, Pablo Venkat, Rakesh Roy, Bodhayan Verschae, José Schaudt, Oliver Veselý, Pavel Schwartz, Roy Weil, Vera Spoerhase, Joachim Wierz, Andreas Stee, Rob van Zych, Anna Contents Approximation Algorithms for k-Connected Graph Factors. . . . . . . . . . . . . . 1 Bodo Manthey and Marten Waanders Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Fabrizio Grandoni, Salvatore Ingala, and Sumedha Uniyal Maximum ATSP with Weights Zero and One via Half-Edges. . . . . . . . . . . . 25 Katarzyna Paluch An FPT 2-Approximation for Tree-cut Decomposition. . . . . . . . . . . . . . . . . 35 Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos Tight Bounds for Double Coverage Against Weak Adversaries. . . . . . . . . . . 47 Nikhil Bansal, Marek Eliáš, Łukasz Jeż, Grigorios Koumoutsos, and Kirk Pruhs Shortest Augmenting Paths for Online Matchings on Trees . . . . . . . . . . . . . 59 Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, and Anna Zych Buyback Problem with Discrete Concave Valuation Functions . . . . . . . . . . . 72 Shun Fukuda, Akiyoshi Shioura, and Takeshi Tokuyama On Temporally Connected Graphs of Small Cost . . . . . . . . . . . . . . . . . . . . 84 Eleni C. Akrida, Leszek Gąsieniec, George B. Mertzios, and Paul G. Spirakis Efficient Vertex-Label Distance Oracles for Planar Graphs. . . . . . . . . . . . . . 97 Shay Mozes and Eyal E. Skop Constant-Time Local Computation Algorithms . . . . . . . . . . . . . . . . . . . . . . 110 Yishay Mansour, Boaz Patt-Shamir, and Shai Vardi An OðlogOPTÞ-Approximation for Covering/Packing Minor Models of h . . . 122 r Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, and Dimitrios M. Thilikos Submodular Function Maximization on the Bounded Integer Lattice . . . . . . . 133 Corinna Gottschalk and Britta Peis X Contents Geometric Hitting Set for Segments of Few Orientations . . . . . . . . . . . . . . . 145 Sándor P. Fekete, Kan Huang, Joseph S.B. Mitchell, Ojas Parekh, and Cynthia A. Phillips On Independent Set on B1-EPG Graphs. . . . . . . . . . . . . . . . . . . . . . . . . . . 158 M. Bougeret, S. Bessy, D. Gonçalves, and C. Paul On the Smoothness of Paging Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . 170 Jan Reineke and Alejandro Salinger SchedulingParallelJobsOnlinewithConvexandConcaveParallelizability .... 183 Roozbeh Ebrahimi, Samuel McCauley, and Benjamin Moseley Scheduling with State-Dependent Machine Speed . . . . . . . . . . . . . . . . . . . . 196 Veerle Timmermans and Tjark Vredeveld Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
Description:The list of books you might like
