000  07779nam a22006375i 4500  

001  9783540409960  
003  DEHe213  
005  20170515111517.0  
007  cr nn 008mamaa  
008  121227s2000 gw  s  0eng d  
020 
_a9783540409960 _99783540409960 

024  7 
_a10.1007/3540409963 _2doi 

050  4  _aQA76.9.D35  
072  7 
_aUMB _2bicssc 

072  7 
_aURY _2bicssc 

072  7 
_aCOM031000 _2bisacsh 

082  0  4 
_a005.74 _223 
245  1  0 
_aAlgorithms and Computation _h[electronic resource] : _b11th International Conference, ISAAC 2000 Taipei, Taiwan, December 18–20, 2000 Proceedings / _cedited by Gerhard Goos, Juris Hartmanis, Jan van Leeuwen, D. T. Lee, ShangHua Teng. 
264  1 
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2000. 

300 
_aXIV, 582 p. _bonline resource. 

336 
_atext _btxt _2rdacontent 

337 
_acomputer _bc _2rdamedia 

338 
_aonline resource _bcr _2rdacarrier 

347 
_atext file _bPDF _2rda 

490  1 
_aLecture Notes in Computer Science, _x03029743 ; _v1969 

505  0  _aInvited Presentations  VoronoiBased Systems of Coordinates and Surface Reconstruction  Essentially Every Unimodular Matrix Defines an Expander  Algorithms and Data Structures (I)  Strategies for Hotlink Assignments  A New Competitive Analysis of Randomized Caching  Online Routing in Convex Subdivisions  Combinatorial Optimization  A Simple LinearTime Approximation Algorithm for Multiprocessor Job Scheduling on Four Processors  Classification of Various Neighborhood Operations for the Nurse Scheduling Problem  Optimal Bid Sequences for MultipleObject Auctions with Unequal Budgets  Algorithms and Data Structures (II)  Coping with Delays and TimeOuts in Binary Search Procedures  Some Formal Analysis of Rocchio’s SimilarityBased Relevance Feedback Algorithm  Reasoning with Ordered Binary Decision Diagrams  Approximation and Randomized Algorithms (I)  On Approximating Minimum Vertex Cover for Graphs with Perfect Matching  A 2Approximation Algorithm for Path Coloring on Trees of Rings  An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree  Algorithms and Data Structures (III)  Finding Independent Spanning Trees in Partial kTrees  On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover  Constructive Linear Time Algorithms for Small Cutwidth and CarvingWidth  Approximation and Randomized Algorithms (II)  Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits  A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane  Simple Algorithms for a Weighted Interval Selection Problem  Graph Drawing and Algorithms  Efficient Minus and Signed Domination in Graphs  Convex Grid Drawings of FourConnected Plane Graphs  An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs  Automata, Cryptography, and Complexity Theory  Undecidability Results for Monoids with LinearTime Decidable Word Problems  Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures  Derandomizing ArthurMerlin Games under Uniform Assumptions  Algorithms and Data Structures (IV)  A Near Optimal Algorithm for Vertex Connectivity Augmentation  Simultaneous Augmentation of Two Graphs to an ?EdgeConnected Graph and a Biconnected Graph  Location Problems Based on NodeConnectivity and EdgeConnectivity between Nodes and NodeSubsets  Parallel and Distributed Algorithms  An Intuitive and Effective New Representation for Interconnection Network Structures  Randomized Leader Election Protocols in Radio Networks with no Collision Detection  Deterministic Broadcasting Time with Partial Knowledge of the Network  Algorithms and Data Structures (V)  Minimizing Makespan in Batch Machine Scheduling  Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time  Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array  Computational Geometry (I)  A Better Lower Bound for TwoCircle Point Labeling  Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set  An Improved Algorithm for Subdivision Traversal without Extra Storage  Algorithms and Data Structures (VI)  Generalized HColoring of Graphs  Finding a TwoCore of a Tree in Linear Time  Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison  Computational Geometry (II)  Optimal Beam Penetrations in Two and Three Dimensions  Searching a Simple Polygon by a kSearcher  Characterization of Rooms Searchable by Two Guards  Computational Biology  Improved Phylogeny Comparisons: Nonshared Edges, Nearest Neighbor Interchanges, and Subtree Transfers  Phylogenetic kRoot and Steiner kRoot  Computational Geometry (III)  Maintenance of a Piercing Set for Intervals with Applications  Optimal Polygon Cover Problems and Applications.  
520  _aThe 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. JeanDaniel Boissonnat, INRIA SophiaAntipolis, France and Professor JinYi 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.  
650  0  _aComputer science.  
650  0  _aComputer communication systems.  
650  0  _aComputer programming.  
650  0  _aData structures (Computer science).  
650  0  _aComputers.  
650  0  _aAlgorithms.  
650  1  4  _aComputer Science. 
650  2  4  _aData Structures, Cryptology and Information Theory. 
650  2  4  _aTheory of Computation. 
650  2  4  _aProgramming Techniques. 
650  2  4  _aAlgorithm Analysis and Problem Complexity. 
650  2  4  _aComputation by Abstract Devices. 
650  2  4  _aComputer Communication Networks. 
700  1 
_aGoos, Gerhard. _eeditor. 

700  1 
_aHartmanis, Juris. _eeditor. 

700  1 
_aLeeuwen, Jan van. _eeditor. 

700  1 
_aLee, D. T. _eeditor. 

700  1 
_aTeng, ShangHua. _eeditor. 

710  2  _aSpringerLink (Online service)  
773  0  _tSpringer eBooks  
776  0  8 
_iPrinted edition: _z9783540412557 
830  0 
_aLecture Notes in Computer Science, _x03029743 ; _v1969 

856  4  0  _uhttp://dx.doi.org/10.1007/3540409963 
912  _aZDB2SCS  
912  _aZDB2LNC  
912  _aZDB2BAE  
942 
_2ddc _cEB 

950  _aComputer Science (Springer11645)  
999 
_c14859 _d14859 