Algorithms and computation

Algorithms and Computation: 12th International Symposium, ISAAC 2001 Christchurch, New Zealand, December 19–21, 2001 Proceedings<br />Author: Peter Eades, Tadao Takaoka<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42985-2<br /> DOI: 10.1007/3-540-45678-3<br /><br />Table of Contents:<p></p><ul><li>Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages </li><li>Application of M-Convex Submodular Flow Problem to Mathematical Economics </li><li>A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling </li><li>A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times </li><li>Semi-normal Schedulings: Improvement on Goemans’ Algorithm </li><li>Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness </li><li>Broadcasting with Universal Lists Revisited: Using Competitive Analysis </li><li>On Adaptive Fault Diagnosis for Multiprocessor Systems </li><li>On-Line Multicasting in All-Optical Networks </li><li>Enumerating Floorplans with n Rooms </li><li>On Min-Max Cycle Bases </li><li>On the Minimum Local