The Resource Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.)
Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.)
Resource Information
The item Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary
 This book constitutes the refereed proceedings of the 12th International Conference on Algorithms and Computation, ISAAC 2001, held in Christchurch, New Zealand in December 2001. The 62 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 124 submissions. The papers are organized in topical sections on combinatorial generation and optimization, parallel and distributed algorithms, graph drawing and algorithms, computational geometry, computational complexity and cryptology, automata and formal languages, computational biology and string matching, and algorithms and data structures
 Language
 eng
 Extent
 1 online resource (xiv, 780 pages)
 Contents

 Invited Talk 1
 Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages
 Combinatorial Generation and Optimization (I)
 Application of MConvex Submodular Flow Problem to Mathematical Economics
 A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling
 A Polynomial Time Approximation Scheme for the Multivehicle Scheduling Problem on a Path with Release and Handling Times
 Seminormal Schedulings: Improvement on Goemans' Algorithm
 Parallel and Distributed Algorithms (I)
 Balanced Scheduling toward LossFree Packet Queuing and Delay Fairness
 Broadcasting with Universal Lists Revisited: Using Competitive Analysis
 On Adaptive Fault Diagnosis for Multiprocessor Systems
 OnLine Multicasting in AllOptical Networks
 Graph Drawing and Algorithms (I)
 Enumerating Floorplans with n Rooms
 On MinMax Cycle Bases
 On the Minimum LocalVertexConnectivity Augmentation in Graphs
 Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number
 Computational Geometry (I)
 Quantum Algorithms for Intersection and Proximity Problems
 BUSHWHACK: An Approximation Algorithm for Minimal Paths through PseudoEuclidean Spaces
 Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees
 TreeApproximations for the Weighted CostDistance Problem
 Computational Complexity and Cryptology
 Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
 Generic Algorithms and Key Agreement Protocols Based on Group Actions
 Baire Category and Nowhere Differentiability for Feasible Real Functions
 Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams
 Automata and Formal Languages
 On Removing the Pushdown Stack in Reachability Constructions
 A New Recognition Algorithm for Extended Regular Expressions
 PolynomialTime Algorithms for the Equivalence for OneWay Quantum Finite Automata
 An Index for the Data Size to Extract Decomposable Structures in LAD
 Invited Talk 2
 Parameterized Complexity: The Main Ideas and Some Research Frontiers
 Graph Drawing and Algorithms (II)
 Tight Bounds on Maximal and Maximum Matchings
 Recognition and Orientation Algorithms for P4Comparability Graphs
 Efficient Algorithms for kTerminal Cuts on Planar Graphs
 Polynomial Time Algorithms for EdgeConnectivity Augmentation of Hamiltonian Paths
 Combinatorial Generation and Optimization (II)
 Algorithms for Pattern Involvement in Permutations
 A Fast Algorithm for Enumerating Bipartite Perfect Matchings
 OnLine Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
 On the Complexity of Train Assignment Problems
 Computational Biology and String Matching (I)
 A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model
 Complexity of Comparing Hidden Markov Models
 DNA SelfAssembly For Constructing 3D Boxes
 Exact Solutions for Closest String and Related Problems
 Computational Geometry (II)
 Topological Peeling and Implementation
 Image Segmentation with Monotonicity and Smoothness Constraints
 Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards
 Approximation of a Geometric Set Covering Problem
 Invited Talk 3
 Shortest Path Algorithms: Engineering Aspects
 Graph Drawing and Algorithms (III)
 Efficient Algorithms for Weighted Colorings of SeriesParallel Graphs
 Go with the Winners Algorithms for Cliques in Random Graphs
 Complexity of Partial Covers of Graphs
 On GameTheoretic Models of Networks
 Parallel and Distributed Algorithms (II)
 The Complexity of Some Basic Problems for Dynamic Process Graphs
 Delay Optimizations in Quorum Consensus
 Randomized Shared Queues Applied to Distributed Optimization Algorithms
 Multiprocess Time Queue
 Computational Geometry (III)
 Labeling Points with Weights
 Small Convex Quadrangulations of Point Sets
 How to Color a Checkerboard with a Given Distribution
 Matrix Rounding Achieving Low 2 {u00D7} 2Discrepancy
 Labeling Subway Lines
 Randomized and Approximation Algorithms
 Complexity Study on Two Clustering Problems
 A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2
 A Unified Framework for Approximating Multiway Partition Problems
 OnLine Algorithms for Cardinality Constrained Bin Packing Problems
 Computational Biology and String Matching (II)
 Suffix Vector: A SpaceEfficient Suffix Tree Representation
 Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
 Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)
 Algorithms and Data Structures
 The Centdian Path Problem on Tree Networks
 Approximate Hotlink Assignment
 Efficient Algorithms for Two Generalized 2Median Problems on Trees
 Isbn
 9783540456780
 Label
 Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings
 Title
 Algorithms and computation
 Title remainder
 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings
 Statement of responsibility
 Peter Eades, Tadao Takaoka (eds.)
 Title variation
 ISAAC 2001
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 12th International Conference on Algorithms and Computation, ISAAC 2001, held in Christchurch, New Zealand in December 2001. The 62 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 124 submissions. The papers are organized in topical sections on combinatorial generation and optimization, parallel and distributed algorithms, graph drawing and algorithms, computational geometry, computational complexity and cryptology, automata and formal languages, computational biology and string matching, and algorithms and data structures
 Cataloging source
 SCPER
 Dewey number
 004.015118
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.9.A43
 LC item number
 I73 2001
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2001
 http://bibfra.me/vocab/lite/meetingName
 ISAAC (Symposium)
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorDate
 1943
 http://library.link/vocab/relatedWorkOrContributorName

 Eades, Peter
 Takaoka, Tadao
 Series statement
 Lecture notes in computer science,
 Series volume
 2223
 http://library.link/vocab/subjectName

 Computer algorithms
 Numerical calculations
 Computer algorithms
 Numerical calculations
 Label
 Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Invited Talk 1  Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages  Combinatorial Generation and Optimization (I)  Application of MConvex Submodular Flow Problem to Mathematical Economics  A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling  A Polynomial Time Approximation Scheme for the Multivehicle Scheduling Problem on a Path with Release and Handling Times  Seminormal Schedulings: Improvement on Goemans' Algorithm  Parallel and Distributed Algorithms (I)  Balanced Scheduling toward LossFree Packet Queuing and Delay Fairness  Broadcasting with Universal Lists Revisited: Using Competitive Analysis  On Adaptive Fault Diagnosis for Multiprocessor Systems  OnLine Multicasting in AllOptical Networks  Graph Drawing and Algorithms (I)  Enumerating Floorplans with n Rooms  On MinMax Cycle Bases  On the Minimum LocalVertexConnectivity Augmentation in Graphs  Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number  Computational Geometry (I)  Quantum Algorithms for Intersection and Proximity Problems  BUSHWHACK: An Approximation Algorithm for Minimal Paths through PseudoEuclidean Spaces  Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees  TreeApproximations for the Weighted CostDistance Problem  Computational Complexity and Cryptology  Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups  Generic Algorithms and Key Agreement Protocols Based on Group Actions  Baire Category and Nowhere Differentiability for Feasible Real Functions  Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams  Automata and Formal Languages  On Removing the Pushdown Stack in Reachability Constructions  A New Recognition Algorithm for Extended Regular Expressions  PolynomialTime Algorithms for the Equivalence for OneWay Quantum Finite Automata  An Index for the Data Size to Extract Decomposable Structures in LAD  Invited Talk 2  Parameterized Complexity: The Main Ideas and Some Research Frontiers  Graph Drawing and Algorithms (II)  Tight Bounds on Maximal and Maximum Matchings  Recognition and Orientation Algorithms for P4Comparability Graphs  Efficient Algorithms for kTerminal Cuts on Planar Graphs  Polynomial Time Algorithms for EdgeConnectivity Augmentation of Hamiltonian Paths  Combinatorial Generation and Optimization (II)  Algorithms for Pattern Involvement in Permutations  A Fast Algorithm for Enumerating Bipartite Perfect Matchings  OnLine Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time  On the Complexity of Train Assignment Problems  Computational Biology and String Matching (I)  A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model  Complexity of Comparing Hidden Markov Models  DNA SelfAssembly For Constructing 3D Boxes  Exact Solutions for Closest String and Related Problems  Computational Geometry (II)  Topological Peeling and Implementation  Image Segmentation with Monotonicity and Smoothness Constraints  Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards  Approximation of a Geometric Set Covering Problem  Invited Talk 3  Shortest Path Algorithms: Engineering Aspects  Graph Drawing and Algorithms (III)  Efficient Algorithms for Weighted Colorings of SeriesParallel Graphs  Go with the Winners Algorithms for Cliques in Random Graphs  Complexity of Partial Covers of Graphs  On GameTheoretic Models of Networks  Parallel and Distributed Algorithms (II)  The Complexity of Some Basic Problems for Dynamic Process Graphs  Delay Optimizations in Quorum Consensus  Randomized Shared Queues Applied to Distributed Optimization Algorithms  Multiprocess Time Queue  Computational Geometry (III)  Labeling Points with Weights  Small Convex Quadrangulations of Point Sets  How to Color a Checkerboard with a Given Distribution  Matrix Rounding Achieving Low 2 {u00D7} 2Discrepancy  Labeling Subway Lines  Randomized and Approximation Algorithms  Complexity Study on Two Clustering Problems  A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2  A Unified Framework for Approximating Multiway Partition Problems  OnLine Algorithms for Cardinality Constrained Bin Packing Problems  Computational Biology and String Matching (II)  Suffix Vector: A SpaceEfficient Suffix Tree Representation  Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works  Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)  Algorithms and Data Structures  The Centdian Path Problem on Tree Networks  Approximate Hotlink Assignment  Efficient Algorithms for Two Generalized 2Median Problems on Trees
 Control code
 325539527
 Dimensions
 unknown
 Extent
 1 online resource (xiv, 780 pages)
 Form of item
 online
 Isbn
 9783540456780
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540456783
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)325539527
 Label
 Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.)
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Invited Talk 1  Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages  Combinatorial Generation and Optimization (I)  Application of MConvex Submodular Flow Problem to Mathematical Economics  A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling  A Polynomial Time Approximation Scheme for the Multivehicle Scheduling Problem on a Path with Release and Handling Times  Seminormal Schedulings: Improvement on Goemans' Algorithm  Parallel and Distributed Algorithms (I)  Balanced Scheduling toward LossFree Packet Queuing and Delay Fairness  Broadcasting with Universal Lists Revisited: Using Competitive Analysis  On Adaptive Fault Diagnosis for Multiprocessor Systems  OnLine Multicasting in AllOptical Networks  Graph Drawing and Algorithms (I)  Enumerating Floorplans with n Rooms  On MinMax Cycle Bases  On the Minimum LocalVertexConnectivity Augmentation in Graphs  Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number  Computational Geometry (I)  Quantum Algorithms for Intersection and Proximity Problems  BUSHWHACK: An Approximation Algorithm for Minimal Paths through PseudoEuclidean Spaces  Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees  TreeApproximations for the Weighted CostDistance Problem  Computational Complexity and Cryptology  Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups  Generic Algorithms and Key Agreement Protocols Based on Group Actions  Baire Category and Nowhere Differentiability for Feasible Real Functions  Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams  Automata and Formal Languages  On Removing the Pushdown Stack in Reachability Constructions  A New Recognition Algorithm for Extended Regular Expressions  PolynomialTime Algorithms for the Equivalence for OneWay Quantum Finite Automata  An Index for the Data Size to Extract Decomposable Structures in LAD  Invited Talk 2  Parameterized Complexity: The Main Ideas and Some Research Frontiers  Graph Drawing and Algorithms (II)  Tight Bounds on Maximal and Maximum Matchings  Recognition and Orientation Algorithms for P4Comparability Graphs  Efficient Algorithms for kTerminal Cuts on Planar Graphs  Polynomial Time Algorithms for EdgeConnectivity Augmentation of Hamiltonian Paths  Combinatorial Generation and Optimization (II)  Algorithms for Pattern Involvement in Permutations  A Fast Algorithm for Enumerating Bipartite Perfect Matchings  OnLine Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time  On the Complexity of Train Assignment Problems  Computational Biology and String Matching (I)  A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model  Complexity of Comparing Hidden Markov Models  DNA SelfAssembly For Constructing 3D Boxes  Exact Solutions for Closest String and Related Problems  Computational Geometry (II)  Topological Peeling and Implementation  Image Segmentation with Monotonicity and Smoothness Constraints  Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards  Approximation of a Geometric Set Covering Problem  Invited Talk 3  Shortest Path Algorithms: Engineering Aspects  Graph Drawing and Algorithms (III)  Efficient Algorithms for Weighted Colorings of SeriesParallel Graphs  Go with the Winners Algorithms for Cliques in Random Graphs  Complexity of Partial Covers of Graphs  On GameTheoretic Models of Networks  Parallel and Distributed Algorithms (II)  The Complexity of Some Basic Problems for Dynamic Process Graphs  Delay Optimizations in Quorum Consensus  Randomized Shared Queues Applied to Distributed Optimization Algorithms  Multiprocess Time Queue  Computational Geometry (III)  Labeling Points with Weights  Small Convex Quadrangulations of Point Sets  How to Color a Checkerboard with a Given Distribution  Matrix Rounding Achieving Low 2 {u00D7} 2Discrepancy  Labeling Subway Lines  Randomized and Approximation Algorithms  Complexity Study on Two Clustering Problems  A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2  A Unified Framework for Approximating Multiway Partition Problems  OnLine Algorithms for Cardinality Constrained Bin Packing Problems  Computational Biology and String Matching (II)  Suffix Vector: A SpaceEfficient Suffix Tree Representation  Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works  Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)  Algorithms and Data Structures  The Centdian Path Problem on Tree Networks  Approximate Hotlink Assignment  Efficient Algorithms for Two Generalized 2Median Problems on Trees
 Control code
 325539527
 Dimensions
 unknown
 Extent
 1 online resource (xiv, 780 pages)
 Form of item
 online
 Isbn
 9783540456780
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540456783
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number
 (OCoLC)325539527
Subject
 Computer algorithms
 Computer algorithms  Congresses
 Conference papers and proceedings
 Conference papers and proceedings
 Numerical calculations  Data processing
 Numerical calculations  Data processing
 Numerical calculations  Data processing  Congresses
 Computer algorithms
Genre
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Algorithmsandcomputation12thinternational/PK55l7Yn7JQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Algorithmsandcomputation12thinternational/PK55l7Yn7JQ/">Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Algorithmsandcomputation12thinternational/PK55l7Yn7JQ/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Algorithmsandcomputation12thinternational/PK55l7Yn7JQ/">Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001 : proceedings, Peter Eades, Tadao Takaoka (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>