Skip to main content
SpringerLink
Log in

Algorithm Theory - SWAT 2006

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

  • Conference proceedings
  • © 2006

Access provided by Autonomous University of Puebla

Download book PDF

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.

Buy print copy

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

Keywords

Table of contents (39 papers)

  1. Front Matter

    Download chapter PDF

  3. Contributed Papers

    1. Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers

      • Yossi Azar, Nir Levy
      Pages 5-16
      Download chapter PDF

    2. Scheduling Jobs on Grid Processors

      • Joan Boyar, Lene M. Favrholdt
      Pages 17-28
      Download chapter PDF

    3. Variable Sized Online Interval Coloring with Bandwidth

      • Leah Epstein, Thomas Erlebach, Asaf Levin
      Pages 29-40
      Download chapter PDF

    4. A Simpler Linear-Time Recognition of Circular-Arc Graphs

      • Haim Kaplan, Yahav Nussbaum
      Pages 41-52
      Download chapter PDF

    5. An \({\cal O}(n^{2.75})\) Algorithm for Online Topological Ordering

      • Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
      Pages 53-64
      Download chapter PDF

    6. Dynamic Matching Markets and Voting Paths

      • David J. Abraham, Telikepalli Kavitha
      Pages 65-76
      Download chapter PDF

    7. Sorting by Merging or Merging by Sorting?

      • Gianni Franceschini
      Pages 77-89
      Download chapter PDF

    8. Finding the Position of the k-Mismatch and Approximate Tandem Repeats

      • Haim Kaplan, Ely Porat, Nira Shafrir
      Pages 90-101
      Download chapter PDF

    9. Unbiased Matrix Rounding

      • Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
      Pages 102-112
      Download chapter PDF

    10. Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines

      • Michael H. Goldwasser, Mark Pedigo
      Pages 113-123
      Download chapter PDF

    11. Paging with Request Sets

      • Leah Epstein, Rob van Stee, Tami Tamir
      Pages 124-135
      Download chapter PDF

    12. Decentralization and Mechanism Design for Online Machine Scheduling

      • Birgit Heydenreich, Rudolf Müller, Marc Uetz
      Pages 136-147
      Download chapter PDF

    13. Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes

      • Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
      Pages 148-159
      Download chapter PDF

    14. Exact Computation of Maximum Induced Forest

      • Igor Razgon
      Pages 160-171
      Download chapter PDF

    15. Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus

      • Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
      Pages 172-183
      Download chapter PDF

    16. On the Approximation Hardness of Some Generalizations of TSP

      • Hans-Joachim Böckenhauer, Juraj Hromkovič, Joachim Kneis, Joachim Kupke
      Pages 184-195
      Download chapter PDF
Back to top

Other volumes

  1. Algorithm Theory – SWAT 2006

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