Algorithm theory - SWAT '94 : 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6 8, 1994 : proceedings
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 Nor...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
824 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithm theory-- SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 1994, proceedings, Erik M. Schmidt, Sven Skyum (eds.), Berlin, Springer-Verlag, 1994, 1 vol. (IX-381 p.), Lecture notes in computer science, 3-540-58218-5 • Algorithm Theory - SWAT '94, Texte imprimé, 9783662163085 |
Indholdsfortegnelse:
- Computing depth orders and related problems
- Selection in monotone matrices and computing k th nearest neighbors
- New on-line algorithms for the page replication problem
- Serving requests with on-line routing
- A new algorithm for the construction of optimal B-trees
- New results on binary space partitions in the plane (extended abstract)
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
- On triangulating planar graphs under the four-connectivity constraint
- Parallel and sequential approximation of shortest superstrings
- Separating translates in the plane: Combinatorial bounds and an algorithm
- Finding all weakly-visible chords of a polygon in linear time
- A tight lower bound for on-line monotonic list labeling
- Trapezoid graphs and generalizations, geometry and algorithms
- Optimal parametric search on graphs of bounded tree-width
- Lower bounds for dynamic algorithms
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees
- On intersection searching problems involving curved objects
- Improved approximations of independent sets in bounded-degree graphs
- Asymptotically optimal election on weighted rings
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
- Recent results in hardness of approximation
- The parallel hierarchical memory model
- Randomized geometric algorithms (abstract)
- Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments
- On self-stabilizing wait-free clock synchronization
- Hard graphs for randomized subgraph exclusion algorithms
- Task scheduling in networks
- Parallel dynamic lowest common ancestors
- An O(log log n) algorithm to compute the kernel of a polygon
- Computing the L 1-diameter and center of asimple rectilinear polygon in parallel
- Exploiting locality in LT-RAM computations
- Efficient preprocessing of simple binary pattern forests
- A parallel algorithm for edge-coloring partial k-trees
- Dominating cliques in distance-hereditary graphs.