Algorithms and Computation : 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings

This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computati...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Ng, Kam W. (Editor), Raghavan, Prabhakar (Editor), Balasubramanian, N.V. (Editor), Chin, Francis Y.L. (Editor)
Format: eBook
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1993, 1993
Edition:1st ed. 1993
Series:Lecture Notes in Computer Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Reaching a goal with directional uncertainty
  • Constructing degree-3 spanners with other sparseness properties
  • Remembering conflicts in history yields dynamic algorithms
  • Coloring random graphs in polynomial expected time
  • Graphical degree sequence problems with connectivity requirements
  • How to treat delete requests in semi-online problems
  • Finding the shortest watchman route in a simple polygon
  • Constructing shortest watchman routes by divide-and-conquer
  • A graph coloring result and its consequences for some guarding problems
  • The maximum k-dependent and f-dependent set problem
  • Finding shortest non-crossing rectilinear paths in plane regions
  • Treewidth of circle graphs
  • A framework for constructing heap-like structures in-place
  • Double-ended binomial queues
  • A simple balanced search tree with O(1) worst-case update time
  • Mapping dynamic data and algorithm structures into product networks
  • Permutation routing on reconfigurable meshes
  • Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists
  • Randomized on-line algorithms for the page replication problem
  • New algorithms for minimizing the longest wire length during circuit compaction
  • Parallel algorithms for single-layer channel routing
  • Consecutive interval query and dynamic programming on intervals
  • An improved algorithm for the traveler's problem
  • Vehicle scheduling on a tree with release and handling times
  • Scheduling algorithms for a chain-like task system
  • Weighted independent perfect domination on cocomparability graphs
  • Plane sweep algorithms for the polygonal approximation problems with applications
  • Optimal rectilinear steiner tree for extremal point sets
  • Faster approximation algorithms for the rectilinear steiner tree problem
  • A survey of recent research
  • Foot-prints vs tokens
  • Recent developments on the approximability of combinatorial problems
  • On the relationship among cryptographic physical assumptions
  • Separating complexity classes related to bounded alternating ?-branching programs
  • The complexity of the optimal variable ordering problems of shared binary decision diagrams
  • On Horn envelopes and hypergraph transversals
  • Page migration algorithms using work functions
  • Memory paging for connectivity and path problems in graphs