Approximation and Online Algorithms: 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers PDF
Preview Approximation and Online Algorithms: 18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers
Christos Kaklamanis Asaf Levin (Eds.) 6 0 Approximation and 8 2 1 S Online Algorithms C N L 18th International Workshop, WAOA 2020 Virtual Event, September 9–10, 2020 Revised Selected Papers Lecture Notes in Computer Science 12806 Founding Editors Gerhard Goos Karlsruhe Institute of Technology, Karlsruhe, Germany Juris Hartmanis Cornell University, Ithaca, NY, USA Editorial Board Members Elisa Bertino Purdue University, West Lafayette, IN, USA Wen Gao Peking University, Beijing, China Bernhard Steffen TU Dortmund University, Dortmund, Germany Gerhard Woeginger RWTH Aachen, Aachen, Germany Moti Yung Columbia University, New York, NY, USA More information about this subseries at http://www.springer.com/series/7407 Christos Kaklamanis Asaf Levin (Eds.) (cid:129) Approximation and Online Algorithms 18th International Workshop, WAOA 2020 – Virtual Event, September 9 10, 2020 Revised Selected Papers 123 Editors Christos Kaklamanis Asaf Levin Computer Technology Institute Faculty of Industrial Engineering University of Patras andManagement Patras, Greece Technion -Israel Institute of Technology Haifa, Israel ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-030-80878-5 ISBN978-3-030-80879-2 (eBook) https://doi.org/10.1007/978-3-030-80879-2 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerNatureSwitzerlandAG2021 Chapter“ExplorableUncertaintyinSchedulingwithNon-uniformTestingTimes”islicensedundertheterms oftheCreativeCommonsAttribution4.0InternationalLicense(http://creativecommons.org/licenses/by/4.0/). Forfurtherdetailsseelicenseinformationinthechapter. 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, expressed or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin publishedmapsandinstitutionalaffiliations. ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface The18thWorkshoponApproximationandOnlineAlgorithms(WAOA2020)focused onthedesignandanalysisofalgorithmsforonlineandcomputationallyhardproblems. Bothkindsofproblemshavealargenumberofapplicationsinavarietyoffields.Due to the COVID-19 pandemic WAOA 2020 took place virtually in Pisa, Italy, during September 9–10 2020, and was a success: it featured many interesting presentations and provided opportunity for stimulating interactions. WAOA 2020 was part of the ALGO 2020 event that also hosted ALGOSENSORS, ATMOS, ESA, and WABI. Topics of interest for WAOA 2020 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 40 submissions. Two submissions were rejected as out of scope right away, and each of the remaining submissions was reviewed by at least three referees, and many of the submissions were reviewed by morethanthreereferees.Thesubmissionsweremainlyjudgedonoriginality,technical quality, and relevance to the topics of the conference. Based on the reviews, the ProgramCommitteeselected15papers.Thisvolumecontainsfinalrevisedversionsof those papers as well as an invited contribution by our invited speaker Cliff Stein. The EasyChair conference system was used to manage the electronic submissions, the review process, and the electronic Program Committee discussions. It made our task much easier. WewouldliketothankalltheauthorswhosubmittedpaperstoWAOA2020andall attendees of WAOA 2020, including the presenters of the accepted papers. A special thank you goes to the plenary invited speaker Cliff Stein for accepting our invitation despite the uncertainty involved due to the pandemic and giving a very nice talk. 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 2020, especially the local chair of the organizing committee Roberto Grossi. May 2021 Christos Kaklamanis Asaf Levin Organization Program Committee Antonios Antoniadis University of Cologne, Germany Christoph Dürr Sorbonne University, France Lene Monrad Favrholdt University of Southern Denmark, Denmark Archontia Giannopoulou National and Kapodistrian University of Athens, Greece Christos Kaklamanis University of Patras and CTI “Diophantus”, Greece (Co-chair) Panagiotis Kanellopoulos University of Essex, UK Tamás Király Eötvös Loránd University, Hungary Danny Krizanc Wesleyan University, USA Asaf Levin (Co-chair) Technion, Israel Bodo Manthey University of Twente, the Netherlands George Mertzios Durham University, UK Zeev Nutov Open University of Israel, Israel Kirk Pruhs University of Pittsburgh, USA Lars Rohwedder EPFL, Switzerland Laura Sanità University of Waterloo, Canada, and Eindhoven University of Technology, the Netherlands Piotr Sankowski University of Warsaw, Poland Kevin Schewior University of Cologne, Germany Baruch Schieber New Jersey Institute of Technology, USA Melanie Schmidt University of Cologne, Germany José Verschae Pontificia Universidad Católica, Chile Pavel Veselý University of Warwick, UK Additional Referees Paritosh Garg Moran Feldman Sebastian Berndt Dimitris Zoros Adam Kurpisz Andreas Wiese Kim-Manuel Klein Malin Rau Nick Harvey Victor Verdugo Hendrik Molter Ulrike Schmidt-Kraepelin István Miklós Andreas Emil Feldmann Moritz Buchem Euiwoong Lee Ruben Hoeksma Rob van Stee Franziska Eberle Mordechai Shalom Hans-Joachim Boeckenhauer Dachuan Xu viii Organization Argyrios Deligkas Christopher Harshaw Parinya Chalermsook An Zhang R. Ravi Bhargav Samineni Jannik Matuschke Leon Ladewig Gyorgy Dosa Andreas Abels Malte Renken Lukasz Jez Daniel R. Schmidt Oleg Pikhurko Etienne Bamas Sasanka Roy Andre Nichterlein Spyridon Maniatis Erik Jan van Leeuwen Pranabendu Misra Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators (Invited Talk) Clifford Stein Columbia University, NewYork,NY10027, USA [email protected] Abstract. Although sequential algorithms with (nearly) optimal running time forfindingshortestpathsinundirected graphswithnon-negativeedgeweights have been known for several decades, near-optimal parallel algorithms have turned out tobeamuch tougher challenge. In this talk, we present a (1+epsilon)-approximate parallel algorithm for computing shortest paths in undirected graphs, achieving polylog depth and near-linear work. All prior all prior (1+epsilon)-algorithms with polylog depth perform at least superlinear work. Improving this long-standing upper bound obtainedbyCohen(STOC’94)hasbeenopenfor25years.Ouralgorithmuses several newtools. Prior workuses hopsets to introduce shortcuts in the graph. Weintroduce anewnotionthatwecalllowhopemulators.Wealsointroduce compressible preconditioners, which we use in conjunction with Serman’s framework (SODA’17) for theuncapacitated minimum cost flowproblem. Contents LP-Based Algorithms for Multistage Minimization Problems . . . . . . . . . . . . 1 Evripidis Bampis, Bruno Escoffier, and Alexander Kononov A Faster FPTAS for Knapsack Problem with Cardinality Constraint . . . . . . . 16 Wenxin Li, Joohyun Lee, and Ness Shroff Distributed Algorithms for Matching in Hypergraphs. . . . . . . . . . . . . . . . . . 30 Oussama Hanguir and Clifford Stein Online Coloring and a New Type of Adversary for Online Graph Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 Yaqiao Li, Vishnu V. Narayan, and Denis Pankratov Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 Guido Schäfer and Bernard G. Zweers A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81 Stav Ashur, Omrit Filtser, and Matthew J. Katz Lasserre Integrality Gaps for Graph Spanners and Related Problems . . . . . . . 97 Michael Dinitz, Yasamin Nazari, and Zeyu Zhang To Close Is Easier Than To Open: Dual Parameterization To k-Median. . . . . 113 JarosławByrka,SzymonDudycz,PasinManurangsi,JanMarcinkowski, and Michał Włodarczyk Explorable Uncertainty in Scheduling with Non-uniform Testing Times. . . . . 127 Susanne Albers and Alexander Eckl Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 Dimitris Christou, Dimitris Fotakis, and Grigorios Koumoutsos Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159 Magnús M. Halldórsson, Guy Kortsarz, and Marek Cygan Concave Connection Cost Facility Location and the Star Inventory Routing Problem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174 Jarosław Byrka and Mateusz Lewandowski
The list of books you might like
