Approximation and Online Algorithms: 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers PDF
Preview Approximation and Online Algorithms: 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers
Leah Epstein Thomas Erlebach (Eds.) 2 1 Approximation and 3 1 1 S Online Algorithms C N L 16th International Workshop, WAOA 2018 Helsinki, Finland, August 23–24, 2018 Revised Selected Papers 123 Lecture Notes in Computer Science 11312 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, Zurich, 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, Chennai, 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 Leah Epstein Thomas Erlebach (Eds.) (cid:129) Approximation and Online Algorithms 16th International Workshop, WAOA 2018 – Helsinki, Finland, August 23 24, 2018 Revised Selected Papers 123 Editors Leah Epstein ThomasErlebach University of Haifa University of Leicester Haifa, Israel Leicester, UK ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-030-04692-7 ISBN978-3-030-04693-4 (eBook) https://doi.org/10.1007/978-3-030-04693-4 LibraryofCongressControlNumber:2018962355 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerNatureSwitzerlandAG2018 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.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin publishedmapsandinstitutionalaffiliations. ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface The16thWorkshoponApproximationandOnlineAlgorithms(WAOA2018)focused onthedesignandanalysisofalgorithmsforonlineandcomputationallyhardproblems. Both kinds of problems have a large number of applications in a variety of fields. WAOA 2018 took place in Helsinki, Finland, during August 23–24, 2018 and was a success: It featured many interesting presentations and provided opportunity for stimulating discussions and interactions. WAOA 2018 was part of the ALGO 2018 event that also hosted ALGOCLOUD, ALGOSENSORS, ATMOS, ESA, IPEC, and WABI. Topics of interest for WAOA 2018 were: graph algorithms, inapproximability results,networkdesign,packingandcovering,paradigmsforthedesignandanalysisof approximationandonlinealgorithms,parameterizedcomplexity,schedulingproblems, algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, mechanism design, resource augmentation, and real-world applications. In response to the call for papers, we received 44 submissions. One submission was rejected as out of scope right away, and each of the remaining sub- missionswasreviewedbyatleastthreereferees.Thesubmissionsweremainlyjudged onoriginality,technicalquality,andrelevancetothetopicsoftheconference.Basedon the reviews, the Program Committee selected 19 papers. This volume contains final revised versions of these papers as well as an invited contribution by our invited speaker Gerhard Woeginger. The EasyChair conference system was used to manage the electronicsubmissions, the review process, and the electronicProgram Committee discussions. It made our task much easier. WewouldliketothankalltheauthorswhosubmittedpaperstoWAOA2018andall attendees of WAOA 2018, including the presenters of the accepted papers. A special thank you goes to the plenary invited speaker Gerhard Woeginger for accepting our invitation, giving a very nice talk, and contributing a paper to these proceedings. We would also like to thank the Program Committee members and the external reviewers for their diligent work in evaluating the submissions and their contributions to the electronicdiscussions.Furthermore,wearegratefultoallthelocalorganizersofALGO 2018, especially the local co-chairs, Parinya Chalermsook, Petteri Kaski, and Jukka Suomela. September 2018 Leah Epstein Thomas Erlebach Organization Program Committee Anna Adamaszek University of Copenhagen, Denmark János Balogh University of Szeged, Hungary Xujin Chen Chinese Academy of Sciences, China Leah Epstein (Co-chair) University of Haifa, Israel Thomas Erlebach University of Leicester, UK (Co-chair) Lene Monrad Favrholdt University of Southern Denmark, Denmark Kazuo Iwama Kyoto University, Japan Łukasz Jeż University of Wrocław, Poland Ralf Klasing CNRS and University of Bordeaux, France Kim-Manuel Klein EPFL, Lausanne, Switzerland Asaf Levin The Technion, Israel Minming Li City University of Hong Kong, China FriedhelmMeyeraufder Paderborn University, Germany Heide Gianpiero Monaco University of L’Aquila, Italy Sharath Raghvendra Virginia Tech, Blacksburg, USA Danny Segev University of Haifa, Israel Roberto Solis-Oba The University of Western Ontario, Canada Angelina Vidali De Montfort University, UK Alexander Wolff Universität Würzburg, Germany Additional Reviewers Adamczyk, Marek Engels, Christian Berndt, Sebastian Fan, Chenglin Bilò, Davide Feldkord, Björn Bilò, Vittorio Feldotto, Matthias Boyar, Joan Foucaud, Florent Bringmann, Karl Garncarek, Paweł Byrka, Jarek Gharibian, Sevag Böckenhauer, Hans-Joachim Goldberg, Noam Chau, Vincent Gouleakis, Themis César San Felice, Mário Grandoni, Fabrizio Dobrev, Stefan Guo, Heng Dosa, Gyorgy Ikenmeyer, Christian Dürr, Christoph Kell, Nathaniel Emek, Yuval Komm, Dennis VIII Organization Kotrbcik, Michal Nikolidaki, Katerina Kralovic, Rastislav Page, Daniel R. Kulkarni, Janardhan Panigrahi, Debmalya Ladewig, Leon Rawitz, Dror Lahn, Nathaniel Rohwedder, Lars Larsen, Kim S. Rotenberg, Eva Levi, Reut Sidford, Aaron Lonc, Zbigniew Spoerhase, Joachim Malatyali, Manuel Sun, Kevin Mazauric, Dorian van Stee, Rob Melissourgos, Themistoklis Velaj, Yllka Mestre, Julian Vinci, Cosimo Moscardelli, Luca Wang, Changjun Mäcker, Alexander Westphal, Stephan Mömke, Tobias Contents Invited Contribution Some Easy and Some Not so Easy Geometric Optimization Problems. . . . . . 3 Gerhard J. Woeginger Regular Papers Deterministic Min-Cost Matching with Delays . . . . . . . . . . . . . . . . . . . . . . 21 Yossi Azar and Amit Jacob Fanani Sequential Metric Dimension . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes A Primal-Dual Online Deterministic Algorithm for Matching with Delays . . . 51 Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, and Paweł Schmidt Advice Complexity of Priority Algorithms. . . . . . . . . . . . . . . . . . . . . . . . . 69 Allan Borodin, Joan Boyar, Kim S. Larsen, and Denis Pankratov Approximating Node-Weighted k-MST on Planar Graphs. . . . . . . . . . . . . . . 87 Jarosław Byrka, Mateusz Lewandowski, and Joachim Spoerhase Exploring Sparse Graphs with Advice (Extended Abstract). . . . . . . . . . . . . . 102 Hans-Joachim Böckenhauer, Janosch Fuchs, and Walter Unger Call Admission Problems on Grids with Advice (Extended Abstract). . . . . . . 118 Hans-Joachim Böckenhauer, Dennis Komm, and Raphael Wegner Improved Approximation Algorithms for Minimum Power Covering Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 Gruia Calinescu, Guy Kortsarz, and Zeev Nutov DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. . . . . . . . . . . . . . . . . . . . . . . 149 MinjunChang,DoritS.Hochbaum,QuicoSpaen,andMarkVelednitsky Strategic Contention Resolution in Multiple Channels . . . . . . . . . . . . . . . . . 165 GeorgeChristodoulou,ThemistoklisMelissourgos,andPaulG.Spirakis Sublinear Graph Augmentation for Fast Query Implementation. . . . . . . . . . . 181 Artur Czumaj, Yishay Mansour, and Shai Vardi X Contents Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 Gyorgy Dosa, Hans Kellerer, and Zsolt Tuza Probabilistic Embeddings of the Fréchet Distance . . . . . . . . . . . . . . . . . . . . 218 Anne Driemel and Amer Krivošija Algorithms for Dynamic NFV Workload . . . . . . . . . . . . . . . . . . . . . . . . . . 238 Yaron Fairstein, Seffi (Joseph) Naor, and Danny Raz Longest Increasing Subsequence Under Persistent Comparison Errors . . . . . . 259 Barbara Geissmann Cut Sparsifiers for Balanced Digraphs. . . . . . . . . . . . . . . . . . . . . . . . . . . . 277 Motoki Ikeda and Shin-ichi Tanigawa Reconfiguration of Graphs with Connectivity Constraints. . . . . . . . . . . . . . . 295 Nicolas Bousquet and Arnaud Mary The Itinerant List Update Problem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 310 Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, and Leen Stougie The Price of Fixed Assignments in Stochastic Extensible Bin Packing. . . . . . 327 Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, and Alexander Tesch Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 349
Description:The list of books you might like
