Skip to main content
  • Conference proceedings
  • © 2006

Algorithm Theory - SWAT 2006

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

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)

Conference series link(s): SWAT: Scandinavian Workshop on Algorithm Theory

Conference proceedings info: SWAT 2006.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (39 papers)

  1. Front Matter

  2. Contributed Papers

    1. Scheduling Jobs on Grid Processors

      • Joan Boyar, Lene M. Favrholdt
      Pages 17-28
    2. Variable Sized Online Interval Coloring with Bandwidth

      • Leah Epstein, Thomas Erlebach, Asaf Levin
      Pages 29-40
    3. A Simpler Linear-Time Recognition of Circular-Arc Graphs

      • Haim Kaplan, Yahav Nussbaum
      Pages 41-52
    4. An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering

      • Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
      Pages 53-64
    5. Dynamic Matching Markets and Voting Paths

      • David J. Abraham, Telikepalli Kavitha
      Pages 65-76
    6. Sorting by Merging or Merging by Sorting?

      • Gianni Franceschini
      Pages 77-89
    7. Finding the Position of the k-Mismatch and Approximate Tandem Repeats

      • Haim Kaplan, Ely Porat, Nira Shafrir
      Pages 90-101
    8. Unbiased Matrix Rounding

      • Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
      Pages 102-112
    9. Paging with Request Sets

      • Leah Epstein, Rob van Stee, Tami Tamir
      Pages 124-135
    10. Decentralization and Mechanism Design for Online Machine Scheduling

      • Birgit Heydenreich, Rudolf Müller, Marc Uetz
      Pages 136-147
    11. Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes

      • Serge Gaspers, Dieter Kratsch, Mathieu Liedloff
      Pages 148-159
    12. Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus

      • Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
      Pages 172-183
    13. On the Approximation Hardness of Some Generalizations of TSP

      • Hans-Joachim Böckenhauer, Juraj Hromkovič, Joachim Kneis, Joachim Kupke
      Pages 184-195

Other Volumes

  1. Algorithm Theory – SWAT 2006

Keywords

  • Variable
  • algorithm
  • algorithmics
  • algorithms
  • approximation
  • calculus
  • combinatorial algorithms
  • complexity
  • computational geometry
  • data structure
  • data structures
  • graph computations
  • grid computing
  • network al
  • optimization
  • algorithm analysis and problem complexity

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

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions