Skip to main content
SpringerLink
Log in

Approximation and Online Algorithms

18th International Workshop, WAOA 2020, Virtual Event, September 9–10, 2020, Revised Selected Papers

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Christos Kaklamanis

    1. Computer Technology Institute, University of Patras, Patras, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Asaf Levin

    1. Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12806)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: WAOA 2020.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 papers)

  1. Front Matter

    Pages i-xii
    Download chapter PDF

  2. LP-Based Algorithms for Multistage Minimization Problems

    • Evripidis Bampis, Bruno Escoffier, Alexander Kononov
    Pages 1-15

  3. A Faster FPTAS for Knapsack Problem with Cardinality Constraint

    • Wenxin Li, Joohyun Lee, Ness Shroff
    Pages 16-29

  4. Distributed Algorithms for Matching in Hypergraphs

    • Oussama Hanguir, Clifford Stein
    Pages 30-46

  5. Online Coloring and a New Type of Adversary for Online Graph Problems

    • Yaqiao Li, Vishnu V. Narayan, Denis Pankratov
    Pages 47-62

  6. Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique

    • Guido Schäfer, Bernard G. Zweers
    Pages 63-80

  7. A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon

    • Stav Ashur, Omrit Filtser, Matthew J. Katz
    Pages 81-96

  8. Lasserre Integrality Gaps for Graph Spanners and Related Problems

    • Michael Dinitz, Yasamin Nazari, Zeyu Zhang
    Pages 97-112

  9. To Close Is Easier Than To Open: Dual Parameterization To k-Median

    • Jarosław Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michał Włodarczyk
    Pages 113-126

  10. Explorable Uncertainty in Scheduling with Non-uniform Testing Times

    • Susanne Albers, Alexander Eckl
    Pages 127-142Open Access

  11. Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics

    • Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos
    Pages 143-158

  12. Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

    • Magnús M. Halldórsson, Guy Kortsarz, Marek Cygan
    Pages 159-173

  13. Concave Connection Cost Facility Location and the Star Inventory Routing Problem

    • Jarosław Byrka, Mateusz Lewandowski
    Pages 174-188

  14. An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem

    • Ardalan Khazraei, Stephan Held
    Pages 189-203

  15. A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks

    • Raghunath Reddy Madireddy, Apurva Mudgal
    Pages 204-219

  16. 2-Node-Connectivity Network Design

    • Zeev Nutov
    Pages 220-235

  17. Back Matter

    Pages 237-237
    Download chapter PDF
Back to top

Other volumes

  1. Approximation and Online Algorithms

Keywords

About this book

This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in  September 2020 as part of ALGO 2020.

The 15 revised full papers presented this book were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2018 were graph algorithms, inapproximability results, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems, algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational -finance, cuts and connectivity, geometric problems, mechanism design, resource augmentation, real-world applications.

Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Editors and Affiliations

  • Computer Technology Institute, University of Patras, Patras, Greece

    Christos Kaklamanis

  • Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel

    Asaf Levin

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation