Skip to main content
  • Conference proceedings
  • © 1997

Algorithms and Computation

8th International Symposium, ISAAC'97, Singapore, December 17-19, 1997, Proceedings.

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

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 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 (44 papers)

  1. Front Matter

  2. Airline crew-scheduling problem with many irregular flights

    • Akira Tajima, Shinji Misono
    Pages 2-11
  3. Hard instance generation for SAT

    • Satoshi Horie, Osamu Watanabe
    Pages 22-31
  4. Playing tetris on meshes and multi-dimensional Shearsort

    • Miroslaw KutyÅ‚owski, Rolf Wanka
    Pages 32-41
  5. Weighted and unweighted selection algorithms for k sorted sequences

    • Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Pages 52-61
  6. An adaptive distributed fault-tolerant routing algorithm for the star graph

    • Leqiang Bail, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda
    Pages 62-71
  7. Multi-color routing in the undirected hypercube

    • Qian-Ping Gu, Hisao Tamaki
    Pages 72-81
  8. Competitive source routing on tori and meshes

    • Tzuoo-Hawn Yeh, heng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
    Pages 82-91
  9. Augmenting edge and vertex connectivities simultaneously

    • Ishii Toshimasa, Nagamochi Hiroshi, Ibaraki Toshihide
    Pages 102-111
  10. Two-face horn extensions

    • Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Pages 112-121
  11. Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae

    • Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
    Pages 122-131
  12. Algorithmic analysis of multithreaded algorithms

    • Charles E. Leiserson
    Pages 132-132
  13. A characterization of planar graphs by pseudo-line arrangements

    • Hisao Tamaki, Takeshi Tokuyama
    Pages 133-142
  14. Optimal fault-tolerant broadcasting in trees

    • Petri§or Panaite, Andrzej Pelc
    Pages 143-152
  15. A theoretical framework of hybrid approaches to MAX SAT

    • Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata
    Pages 153-162

Other Volumes

  1. Algorithms and Computation

About this book

This book constitutes the refereed proceedings of the 8th International Symposium on Algorithms and Computation, ISAAC'97, held in Singapore in December 1997. The 42 revised full papers presented were selected from a total of 98 submissions. The scope of the volume spans the whole area of algorithms from discrete mathematics and complexity theory to algorithms design and evaluation in a variety of applicational areas. Among the topics addressed are scheduling and logistics, networking and routing, combinatorial optimization, graph-computations, algorithmic learning, computational geometry, etc.

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