Algorithms — ESA '97 : 5th Annual European Symposium Graz, Austria, September 15–17, 1997 Proceedings

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Scheduling independent multiprocessor tasks
3. Altmetric Badge
   Chapter 2 On local search for weighted κ-set packing
4. Altmetric Badge
   Chapter 3 On-line machine covering
5. Altmetric Badge
   Chapter 4 Area-efficient static and incremental graph drawings
6. Altmetric Badge
   Chapter 5 Denesting by bounded degree radicals
7. Altmetric Badge
   Chapter 6 a linear time algorithm for the arc disjoint Menger problem in planar directed graphs
8. Altmetric Badge
   Chapter 7 Distance approximating trees for chordal and dually chordal graphs
9. Altmetric Badge
   Chapter 8 Decomposition of integer programs and of generating sets
10. Altmetric Badge
    Chapter 9 Bounded degree spanning trees
11. Altmetric Badge
    Chapter 10 Optimal adaptive broadcasting with a bounded fraction of faulty nodes
12. Altmetric Badge
    Chapter 11 Weighted graph separators and their applications
13. Altmetric Badge
    Chapter 12 A new exact algorithm for general orthogonal d-dimensional knapsack problems
14. Altmetric Badge
    Chapter 13 Dynamic data structures for realtime management of large geometric scenes
15. Altmetric Badge
    Chapter 14 Solving rectilinear Steiner tree problems exactly in theory and practice
16. Altmetric Badge
    Chapter 15 Dynamically switching vertices in planar graphs
17. Altmetric Badge
    Chapter 16 A new family of randomized algorithms for list accessing
18. Altmetric Badge
    Chapter 17 On-line construction of two-dimensional suffix trees
19. Altmetric Badge
    Chapter 18 Scheduling multiclass queueing networks on parallel servers: Approximate and heavy-traffic optimality of Klimov's priority rule
20. Altmetric Badge
    Chapter 19 Optimal reconstruction of graphs under the additive model
21. Altmetric Badge
    Chapter 20 Fixing variables in semidefinite relaxations
22. Altmetric Badge
    Chapter 21 Test sets of the knapsack problem and simultaneous diophantine approximation
23. Altmetric Badge
    Chapter 22 Three-dimensional meshes are less powerful than two-dimensional ones in oblivious routing
24. Altmetric Badge
    Chapter 23 Fault-tolerant real-time scheduling
25. Altmetric Badge
    Chapter 24 Collecting garbage pages in a distributed shared memory with reduced memory and communication overhead
26. Altmetric Badge
    Chapter 25 Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems
27. Altmetric Badge
    Chapter 26 Minimum spanning trees in d dimensions
28. Altmetric Badge
    Chapter 27 Relaxed balance for search trees with local rebalancing
29. Altmetric Badge
    Chapter 28 Improved approximations for minimum cardinality quadrangulations of finite element meshes
30. Altmetric Badge
    Chapter 29 Dynamic storage allocation with known durations
31. Altmetric Badge
    Chapter 30 Coloring in sublinear time
32. Altmetric Badge
    Chapter 31 Competitive analysis of on-line stack-up algorithms
33. Altmetric Badge
    Chapter 32 Scheduling-LPs bear probabilities randomized approximations for min-sum criteria
34. Altmetric Badge
    Chapter 33 On piercing sets of axis-parallel rectangles and rings
35. Altmetric Badge
    Chapter 34 Seven problems: So different yet close
36. Altmetric Badge
    Chapter 35 Linear-time reconstruction of Delaunay triangulations with applications
37. Altmetric Badge
    Chapter 36 Approximating satisfiable satisfiability problems
38. Altmetric Badge
    Chapter 37 Algorithms for computing signs of 2 x 2 determinants: Dynamics and average-case analysis
39. Altmetric Badge
    Chapter 38 Reconstructing the topology of a CAD model - A discrete approach -