Algorithm Theory – SWAT 2014

14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings

  • R. Ravi
  • Inge Li Gørtz
Conference proceedings SWAT 2014

DOI: 10.1007/978-3-319-08404-6

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

Table of contents (33 papers)

  1. Front Matter
  2. I/O-Efficient Range Minima Queries
    Peyman Afshani, Nodari Sitchinava
    Pages 1-12
  3. Online Makespan Minimization with Parallel Schedules
    Susanne Albers, Matthias Hellwig
    Pages 13-25
  4. Expected Linear Time Sorting for Word Size Ω(log2n loglogn)
    Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen
    Pages 26-37
  5. New Approximability Results for the Robust k-Median Problem
    Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann
    Pages 50-61
  6. Approximating the Revenue Maximization Problem with Sharp Demands
    Vittorio Bilò, Michele Flammini, Gianpiero Monaco
    Pages 74-85
  7. Reconfiguring Independent Sets in Claw-Free Graphs
    Paul Bonsma, Marcin Kamiński, Marcin Wrochna
    Pages 86-97
  8. Competitive Online Routing on Delaunay Triangulations
    Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian
    Pages 98-109
  9. Optimal Planar Orthogonal Skyline Counting Queries
    Gerth Stølting Brodal, Kasper Green Larsen
    Pages 110-121
  10. B-slack Trees: Space Efficient B-Trees
    Trevor Brown
    Pages 122-133
  11. Approximately Minwise Independence with Twisted Tabulation
    Søren Dahlgaard, Mikkel Thorup
    Pages 134-145
  12. Separability of Imprecise Points
    Mark de Berg, Ali D. Mehrabi, Farnaz Sheikhi
    Pages 146-157
  13. Line-Distortion, Bandwidth and Path-Length of a Graph
    Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
    Pages 158-169
  14. Colorful Bin Packing
    György Dósa, Leah Epstein
    Pages 170-181
  15. Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques
    Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca
    Pages 182-193
  16. Win-Win Kernelization for Degree Sequence Completion Problems
    Vincent Froese, André Nichterlein, Rolf Niedermeier
    Pages 194-205

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 14th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. The 33 papers were carefully reviewed and selected from a total of 134 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures including but not limited to approximation algorithms, parameterized algorithms, computational biology, computational geometry and topology, distributed algorithms, external-memory algorithms, exponential algorithms, graph algorithms, online algorithms, optimization algorithms, randomized algorithms, streaming algorithms, string algorithms, sublinear algorithms, and algorithmic game theory.

Keywords

algorithmic game theory aproximation algorithms aproximation algorithms computational biology computational biology concurrent tree data structures distributed algorithms distributed algorithms graph algorithms analysis optimization algorithms parameterized complexity and exact algorithms parameterized complexity and exact algorithms pattern matching pattern matching

Editors and affiliations

  • R. Ravi
    • 1
  • Inge Li Gørtz
    • 2
  1. 1.Tepper School of BusinessCarnegie Mellon UniversityPittsburghUSA
  2. 2.DTU InformaticsKongens LyngbyDenmark

Bibliographic information

  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-08403-9
  • Online ISBN 978-3-319-08404-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349