Skip to main content
SpringerLink
Log in
Book cover

Algorithm Theory - SWAT 2010

12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Haim Kaplan

    1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast track conference proceedings
  • State-of-the-art report

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

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

Included in the following conference series:

Conference proceedings info: SWAT 2010.

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

  1. Front Matter

    Download chapter PDF

  2. Optimal Exploration of Terrains with Obstacles

    • Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
    Pages 1-12

  3. Reconstructing a Simple Polygon from Its Angles

    • Yann Disser, Matúš Mihalák, Peter Widmayer
    Pages 13-24

  4. Semidefinite Programming and Approximation Algorithms: A Survey

    • Sanjeev Arora
    Pages 25-25

  5. Strictly-Regular Number System and Data Structures

    • Amr Elmasry, Claus Jensen, Jyrki Katajainen
    Pages 26-37

  6. An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

    • Prosenjit Bose, Karim Douïeb, Vida Dujmović, Rolf Fagerberg
    Pages 38-49

  7. The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition

    • Jie Gao, Dengpan Zhou
    Pages 50-61

  8. A Bottom-Up Method and Fast Algorithms for max independent set

    • Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
    Pages 62-73

  9. Capacitated Domination Faster Than O(2n)

    • Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
    Pages 74-80

  10. Isomorphism for Graphs of Bounded Feedback Vertex Set Number

    • Stefan Kratsch, Pascal Schweitzer
    Pages 81-92

  11. On Feedback Vertex Set New Measure and New Structures

    • Yixin Cao, Jianer Chen, Yang Liu
    Pages 93-104

  12. Conflict-Free Coloring Made Stronger

    • Elad Horev, Roi Krakovski, Shakhar Smorodinsky
    Pages 105-117

  13. Polychromatic Coloring for Half-Planes

    • Shakhar Smorodinsky, Yelena Yuditsky
    Pages 118-126

  14. A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem

    • Zhou Xu, Brian Rodrigues
    Pages 127-138

  15. Minimum and Maximum against k Lies

    • Michael Hoffmann, Jiří MatouÅ¡ek, Yoshio Okamoto, Philipp Zumstein
    Pages 139-149

  16. Feasible and Accurate Algorithms for Covering Semidefinite Programs

    • Garud Iyengar, David J. Phillips, Cliff Stein
    Pages 150-162

  17. The Quantitative Analysis of User Behavior Online – Data, Models and Algorithms

    • Prabhakar Raghavan
    Pages 163-163

  18. Systems of Linear Equations over \(\mathbb{F}_2\) and Problems Parameterized above Average

    • Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa
    Pages 164-175

  19. Capacitated max -Batching with Interval Graph Compatibilities

    • Tim Nonner
    Pages 176-187

  20. A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs

    • Imran A. Pirwani, Mohammad R. Salavatipour
    Pages 188-199
Back to top

Other volumes

  1. Algorithm Theory - SWAT 2010

Keywords

Editors and Affiliations

  • School of Computer Science, Tel Aviv University, Tel Aviv, Israel

    Haim Kaplan

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation