Skip to main content
SpringerLink
Log in

Algorithms and Computations

10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings

  • Conference proceedings
  • © 1999

Overview

Authors:
  1. Alok Aggarwal

    1. IBM, Solutions Research Center, Block 1 Indian Institute of Technology, New Delhi, India

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. C. Pandu Rangan

    1. Department of Computer Science and Engineering, Indian Institute of Technology, Madras, India

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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. Session 5(a) - Computational Geometry I

    1. How Many People Can Hide in a Terrain?

      • Stephan Eidenbenz
      Pages 184-194

    2. Carrying Umbrellas: An Online Relocation Problem on Graphs

      • Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
      Pages 195-204

  2. Session 5(b) - Parallel & Distributed Computing II

    1. Survivable Networks with Bounded Delay: The Edge Failure Case

      • Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
      Pages 205-214

    2. Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks

      • J. L. Bordim, J. Cui, T. Hayashi, K. Nakano, S. Olariu
      Pages 215-224

  3. Session 6(a) - Data Structure II

    1. Constructing the Suffix Tree of a Tree with a Large Alphabet

      • Tetsuo Shibuya
      Pages 225-236

    2. An O(1) Time Algorithm for Generating Multiset Permutations

      • Tadao Takaoka
      Pages 237-246

  4. Session 6(b) - Complexity Theory II

    1. Upper Bounds for MaxSat: Further Improved

      • Nikhil Bansal, Venkatesh Raman
      Pages 247-258

    2. A Linear Time Algorithm for Recognizing Regular Boolean Functions

      • Kazuhisa Makino
      Pages 259-268

  5. Session 7(a) - Computational Geometry II

    1. Station Layouts in the Presence of Location Constraints

      • Christos Kaklamanis, Lefteris M. Kirousis, Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, David Peleg
      Pages 269-278

    2. Reverse Center Location Problem

      • Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
      Pages 279-294

  6. Session 7(b) - Algorithms in Practice

    1. Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields

      • Abhijit Das, C. E. Veni Madhavan
      Pages 295-306

    2. External Memory Algorithms for Outerplanar Graphs

      • Anil Maheshwari, Norbert Zeh
      Pages 307-316

  7. Session 8(a) - Approximate Algorithm III

    1. A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree

      • Tetsuo Asano, Kazuhiro Kawashima, Naoki Katoh
      Pages 317-326

    2. Approximation Algorithms for Channel Assignment with Constraints

      • Jeannette Janssen, Lata Narayanan
      Pages 327-336

  8. Session 8(b) - Graph Algorithm II

    1. Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs

      • Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki
      Pages 337-346

    2. A Linear Algorithm for Finding Total Colorings of Partial k-Trees

      • Shuji Isobe, Xiao Zhou, Takao Nishizeki
      Pages 347-356

  9. Invited Talk

    1. Topology-Oriented Approach to Robust Geometric Computation

      • Kokichi Sugihara
      Pages 357-366

  10. Session 9(a) - Approximate Algorithm IV

    1. Approximating Multicast Congestion

      • Santosh Vempala, Berthold Vöcking
      Pages 367-372

    2. Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts

      • Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
      Pages 373-382

  11. Session 9(b) - Parallel & Distributed Computing III

    1. Online Scheduling of Parallel Communications with Individual Deadlines

      • Jae-Ha Lee, Kyung-Yong Chwa
      Pages 383-392
Back to top

Keywords

Authors and Affiliations

  • IBM, Solutions Research Center, Block 1 Indian Institute of Technology, New Delhi, India

    Alok Aggarwal

  • Department of Computer Science and Engineering, Indian Institute of Technology, Madras, India

    C. Pandu Rangan

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation