Skip to main content
SpringerLink
Log in
Book cover

Algorithm Theory - SWAT 2006

10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Lars Arge

    1. MADALGO, Department of Computer Science, University of Aarhus, Denmark

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Rusins Freivalds

    1. Institute of Mathematics and Computer Science, University of Latvia, Latvia

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

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

Included in the following conference series:

Conference proceedings info: SWAT 2006.

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. Contributed Papers

    1. Reoptimization of Minimum and Maximum Traveling Salesman’s Tours

      • Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
      Pages 196-207

    2. The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights

      • Spyros Angelopoulos
      Pages 208-219

    3. On Guarding Rectilinear Domains

      • Matthew J. Katz, Gabriel S. Roisman
      Pages 220-231

    4. Approximation Algorithms for the Minimum Convex Partition Problem

      • Christian Knauer, Andreas Spillner
      Pages 232-241

    5. Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles

      • Matthias Müller-Hannemann, Anna Schulze
      Pages 242-254

    6. Simultaneous Embedding with Two Bends per Edge in Polynomial Area

      • Frank Kammer
      Pages 255-267

    7. Acyclic Orientation of Drawings

      • Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
      Pages 268-279

    8. Improved Algorithms for Quantum Identification of Boolean Oracles

      • Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita
      Pages 280-291

    9. Approximability of Minimum AND-Circuits

      • Jan Arpe, Bodo Manthey
      Pages 292-303

    10. Triangles, 4-Cycles and Parameterized (In-)Tractability

      • Venkatesh Raman, Saket Saurabh
      Pages 304-315

    11. Better Approximation Schemes for Disk Graphs

      • Erik Jan van Leeuwen
      Pages 316-327

    12. An Approximation Algorithm for the Wireless Gathering Problem

      • Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
      Pages 328-338

    13. Minimum Membership Set Covering and the Consecutive Ones Property

      • Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
      Pages 339-350

    14. Approximating Rational Objectives Is as Easy as Approximating Linear Ones

      • José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi
      Pages 351-362

    15. In-Place Algorithms for Computing (Layers of) Maxima

      • Henrik Blunck, Jan Vahrenhold
      Pages 363-374

    16. Largest and Smallest Tours and Convex Hulls for Imprecise Points

      • Maarten Löffler, Marc van Kreveld
      Pages 375-387

    17. On Spanners of Geometric Graphs

      • Joachim Gudmundsson, Michiel Smid
      Pages 388-399

    18. The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems

      • Josiah Carlson, David Eppstein
      Pages 400-410

    19. Linear-Time Algorithms for Tree Root Problems

      • Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
      Pages 411-422

    20. Generalized Powers of Graphs and Their Algorithmic Use

      • Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan
      Pages 423-434
Back to top

Other volumes

  1. Algorithm Theory – SWAT 2006

Keywords

Editors and Affiliations

  • MADALGO, Department of Computer Science, University of Aarhus, Denmark

    Lars Arge

  • Institute of Mathematics and Computer Science, University of Latvia, Latvia

    Rusins Freivalds

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation