Lecture Notes in Computer Science

Algorithms and Computation

11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000. Proceedings

Editors: Lee, D.T., Teng, Shang-Hua (Eds.)

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-40996-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $149.00
price for USA
  • ISBN 978-3-540-41255-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), and Chennai (1999). Submissions to the conference this year were conducted entirely electro- cally. Thanks to the excellent software developed by the Institute of Information Science, Academia Sinica, we were able to carry out virtually all communication via the World Wide Web. In response to the call for papers, a total of 87 extended abstracts were submitted from 25 countries. Each submitted paper was handled by at least three program committee members, with the assistance of a number of external reviewers, as indicated by the referee list found in the proceedings. There were many more acceptable papers than there was space available in the symposium program, which made the program committee’s task extremely di cult. Finally 46 papers were selected for presentation at the Symposium. In addition to these contributed papers, the conference also included two invited presentations by Dr. Jean-Daniel Boissonnat, INRIA Sophia-Antipolis, France and Professor Jin-Yi Cai, University of Wisconsin at Madison, Wisconsin, USA. It is expected that most of the accepted papers will appear in a more complete form in scienti c journals.

Table of contents (6 chapters)

  • Classification of Various Neighborhood Operations for the Nurse Scheduling Problem

    Takayuki Osogami, Hiroshi Imai

    Pages 72-83

  • A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane

    Norihiro Kubo, Katsuhiro Muramoto, Shinichi Shimozono

    Pages 216-227

  • Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures

    Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi1

    Pages 290-301

  • Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers

    Wing-Kai Hon, Ming-Yang Kao, Tak-Wah Lam

    Pages 527-538

  • Phylogenetic k-Root and Steiner k-Root

    Guo-Hui Lin, Paul E. Kearney, Tao Jiang

    Pages 539-551

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-40996-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $149.00
price for USA
  • ISBN 978-3-540-41255-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Algorithms and Computation
Book Subtitle
11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000. Proceedings
Editors
  • D.T. Lee
  • Shang-Hua Teng
Series Title
Lecture Notes in Computer Science
Series Volume
1969
Copyright
2000
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-40996-0
DOI
10.1007/3-540-40996-3
Softcover ISBN
978-3-540-41255-7
Series ISSN
0302-9743
Edition Number
1
Number of Pages
XIV, 582
Topics