Skip to main content
SpringerLink
Log in
Book cover

Approximation and Online Algorithms

11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Christos Kaklamanis

    1. Computer Technology Institute and Press “Diophantus” & Department of Computer Engineering and Informatics, University of Patras, Rio, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kirk Pruhs

    1. University of Pittsburgh, Pittsburgh, USA

    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 8447)

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

Included in the following conference series:

Conference proceedings info: WAOA 2013.

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 44.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 (14 papers)

  1. Front Matter

    Download chapter PDF

  2. Min-Sum 2-Paths Problems

    • Trevor Fenner, Oded Lachish, Alexandru Popa
    Pages 1-11

  3. Low Dimensional Embeddings of Doubling Metrics

    • Ofer Neiman
    Pages 12-23

  4. Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation

    • Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
    Pages 24-36

  5. On the max min vertex cover Problem

    • Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
    Pages 37-48

  6. On Fixed Cost k-Flow Problems

    • MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
    Pages 49-60

  7. Approximating the Quadratic Knapsack Problem on Special Graph Classes

    • Ulrich Pferschy, Joachim Schauer
    Pages 61-72

  8. Approximating the Sparsest k-Subgraph in Chordal Graphs

    • Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
    Pages 73-84

  9. Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter

    • Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki
    Pages 85-96

  10. Inapproximability Results for Graph Convexity Parameters

    • Erika M. M. Coelho, Mitre C. Dourado, Rudini M. Sampaio
    Pages 97-107

  11. Continuum Armed Bandit Problem of Few Variables in High Dimensions

    • Hemant Tyagi, Bernd Gärtner
    Pages 108-119

  12. Approximability of Connected Factors

    • Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
    Pages 120-131

  13. Reordering Buffer Management with Advice

    • Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
    Pages 132-143

  14. Online Knapsack Revisited

    • Marek Cygan, Łukasz Jeż
    Pages 144-155

  15. Counting Approximately-Shortest Paths in Directed Acyclic Graphs

    • Matúš Mihalák, Rastislav Šrámek, Peter Widmayer
    Pages 156-167

  16. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Approximation and Online Algorithms

Keywords

About this book

This book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. They focus on the design and analysis of algorithms for online and computationally hard problems, for example in algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability results, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, real-world applications, scheduling problems.

Editors and Affiliations

  • Computer Technology Institute and Press “Diophantus” & Department of Computer Engineering and Informatics, University of Patras, Rio, Greece

    Christos Kaklamanis

  • University of Pittsburgh, Pittsburgh, USA

    Kirk Pruhs

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation