Algorithm Theory - SWAT '94

1. Optimal algorithms for broadcast and gossip in the edge-disjoint path modes

   • Juraj Hromkovič, Ralf Klasing, Walter Unger, Hubert Wagener

   Pages 219-230

2. Recent results in hardness of approximation

   • Johan Håstad

   Pages 231-239

3. The parallel hierarchical memory model

   • Ben H. H. Juurlink, Harry A. G. Wijshoff

   Pages 240-251

4. Randomized geometric algorithms (abstract)

   • Ketan Mulmuley

   Pages 252-254

5. Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments

   • Leonidas Palios

   Pages 255-266

6. On self-stabilizing wait-free clock synchronization

   • Marina Papatriantafilou, Philippas Tsigas

   Pages 267-277

7. Hard graphs for randomized subgraph exclusion algorithms

   • Marcus Peinado

   Pages 278-289

8. Task scheduling in networks

   • Cynthia Phillips, Clifford Stein, Joel Wein

   Pages 290-301

9. Parallel dynamic lowest common ancestors

   • Eric Schenk

   Pages 302-313

10. An O(log log n) algorithm to compute the kernel of a polygon

    • S. Schuierer

    Pages 314-325

11. Computing the L ₁-diameter and center of a simple rectilinear polygon in parallel

    • Sven Schuierer

    Pages 326-337

12. Exploiting locality in LT-RAM computations

    • Jop F. Sibeyn, Tim Harris

    Pages 338-349

13. Efficient preprocessing of simple binary pattern forests

    • Mikkel Thorup

    Pages 350-358

14. A parallel algorithm for edge-coloring partial k-trees

    • Xiao Zhou, Shin-ichi Nakano, Takao Nishizeki

    Pages 359-369

15. Dominating cliques in distance-hereditary graphs

    • Feodor F. Dragan

    Pages 370-381

16. Back Matter

    PDF

This volume constitutes the proceedings of SWAT '94, the 4th Scandinavian Workshop on Algorithm Theory, held in Aarhus, Denmark in July 1994. The SWAT events are organized each even year and alternate with the WADS meetings (Workshops on Algorithms and Data Structures) held each odd year in North America.
The volume contains 31 papers selected from a total of 100 submissions and 3 invited presentations by Michael Fredman (Rutgers), Johan Hastad (Stockholm), and Ketan Mulmuley (Chicago). The contributions cover algorithms and data structures in all areas of computer science and in discrete mathematics, particularly including graph theory, computational geometry, and databases.

• Algorithmen
• Computer-Geometrie
• Datenstrukturen
• Graph Algorithms
• Graph-Algorithmen
• Voronoi Diagrams
• Voronoi-Diagramme
• algorithms
• computational geometry
• data structures
• algorithm analysis and problem complexity

Policies and ethics