Skip to main content
SpringerLink
Log in

Algorithms and Computation

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

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Hon Wai Leong
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Hiroshi Imai
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Sanjay Jain
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: ISAAC 1997.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (44 papers)

  1. Front Matter

    Download chapter PDF

  2. Solving NP-hard combinatorial problems in the practical sense Invited presentation

    • Toshihide Ibaraki
    Pages 1-1

  3. Airline crew-scheduling problem with many irregular flights

    • Akira Tajima, Shinji Misono
    Pages 2-11

  4. Practical approach to a facility location problem for large-scale logistics

    • Kazuyoshi Hidaka, Hiroyuki Okano
    Pages 12-21

  5. Hard instance generation for SAT

    • Satoshi Horie, Osamu Watanabe
    Pages 22-31

  6. Playing tetris on meshes and multi-dimensional Shearsort

    • Miroslaw KutyÅ‚owski, Rolf Wanka
    Pages 32-41

  7. Formulation of the addition-shift-sequence problem and its complexity

    • Akihiro Matsuura, Akira Nagoya
    Pages 42-51

  8. Weighted and unweighted selection algorithms for k sorted sequences

    • Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Pages 52-61

  9. An adaptive distributed fault-tolerant routing algorithm for the star graph

    • Leqiang Bail, Hiroyuki Ebara, Hideo Nakano, Hajime Maeda
    Pages 62-71

  10. Multi-color routing in the undirected hypercube

    • Qian-Ping Gu, Hisao Tamaki
    Pages 72-81

  11. Competitive source routing on tori and meshes

    • Tzuoo-Hawn Yeh, heng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
    Pages 82-91

  12. Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs

    • Takeaki Uno
    Pages 92-101

  13. Augmenting edge and vertex connectivities simultaneously

    • Ishii Toshimasa, Nagamochi Hiroshi, Ibaraki Toshihide
    Pages 102-111

  14. Two-face horn extensions

    • Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Pages 112-121

  15. Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae

    • Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
    Pages 122-131

  16. Algorithmic analysis of multithreaded algorithms

    • Charles E. Leiserson
    Pages 132-132

  17. A characterization of planar graphs by pseudo-line arrangements

    • Hisao Tamaki, Takeshi Tokuyama
    Pages 133-142

  18. Optimal fault-tolerant broadcasting in trees

    • Petri§or Panaite, Andrzej Pelc
    Pages 143-152

  19. A theoretical framework of hybrid approaches to MAX SAT

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

  20. Exponential lower bounds on the size of OBDDs representing integer division

    • Takashi Horiyama, Shuzo Yajima
    Pages 163-172
Back to top

Other volumes

  1. Algorithms and Computation

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation