Skip to main content
  • Conference proceedings
  • © 1997

Algorithms - ESA '97

5th Annual European Symposium, Graz, Austria, September 15-17, 1997. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1284)

Conference series link(s): ESA: European Symposium on Algorithms

Conference proceedings info: ESA 1997.

Buy it now

Buying options

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

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (38 papers)

  1. Front Matter

  2. Scheduling independent multiprocessor tasks

    • A. K. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis
    Pages 1-12
  3. On local search for weighted κ-set packing

    • Esther M. Arkin, Refael Hassin
    Pages 13-22
  4. On-line machine covering

    • Yossi Azar, Leah Epstein
    Pages 23-36
  5. Area-efficient static and incremental graph drawings

    • Therese C. Biedl, Michael Kaufmann
    Pages 37-52
  6. Denesting by bounded degree radicals

    • Johannes Blömer
    Pages 53-63
  7. Distance approximating trees for chordal and dually chordal graphs

    • Andreas Brandstädt, Victor Chepoi, Feodor Dragan
    Pages 78-91
  8. Decomposition of integer programs and of generating sets

    • G. Cornuejols, R. Urbaniak, R. Weismantel, L. Wolsey
    Pages 92-103
  9. Bounded degree spanning trees

    • Artur Czumaj, Willy-B. Strothmann
    Pages 104-117
  10. Weighted graph separators and their applications

    • Hristo N. Djidjev
    Pages 130-143
  11. A new exact algorithm for general orthogonal d-dimensional knapsack problems

    • Sándor P. Fekete, Jörg Schepers
    Pages 144-156
  12. Dynamic data structures for realtime management of large geometric scenes

    • M. Fischer, F. Meyer auf der Heide, W. -B. Strothmann
    Pages 157-170
  13. Solving rectilinear Steiner tree problems exactly in theory and practice

    • Ulrich Fößmeier, Michael Kaufmann
    Pages 171-185
  14. Dynamically switching vertices in planar graphs

    • Daniele Frigioni, Giuseppe F. Italiano
    Pages 186-199
  15. A new family of randomized algorithms for list accessing

    • Theodoulos Garefalakis
    Pages 200-216
  16. On-line construction of two-dimensional suffix trees

    • Raffaele Giancarlo, Daniela Guaiana
    Pages 217-231
  17. Optimal reconstruction of graphs under the additive model

    • Vladimir Grebinski, Gregory Kucherov
    Pages 246-258

Other Volumes

  1. Algorithms — ESA '97

About this book

This book constitutes the refereed proceedings of the 5th Annual International European Symposium on Algorithms, ESA'97, held in Graz, Austria, September 1997.
The 38 revised full papers presented were selected from 112 submitted papers. The papers address a broad spectrum of theoretical and applicational aspects in algorithms theory and design. Among the topics covered are approximation algorithms, graph and network algorithms, combinatorial optimization, computational biology, computational mathematics, data compression, distributed computing, evolutionary algorithms, neural computing, online algorithms, parallel computing, pattern matching, and others.

Bibliographic Information

Buy it now

Buying options

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

Other ways to access