Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)
Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)
Resource Information
The item Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Language

 eng
 eng
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XIV, 790 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 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 × 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
 edited by Peter Eades, Tadao Takaoka
 Language

 eng
 eng
 Dewey number
 005.11
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 a1zoXQiBYbs
 Jmq57ObiH6k
 Image bit depth
 0
 Language note
 English
 LC call number
 QA76.676.66
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2001
 http://bibfra.me/vocab/lite/meetingName
 International Symposium, ISAAC 2001
 Nature of contents
 dictionaries
 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 programming
 Computers
 Algorithms
 Computer communication systems
 Computer science—Mathematics
 Programming Techniques
 Theory of Computation
 Algorithm Analysis and Problem Complexity
 Computation by Abstract Devices
 Computer Communication Networks
 Discrete Mathematics in Computer Science
 Label
 Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references at the end of each chapters and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 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 × 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
 Dimensions
 unknown
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XIV, 790 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540456780
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/3540456783
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000211619
 (SSID)ssj0000321205
 (PQKBManifestationID)11220352
 (PQKBTitleCode)TC0000321205
 (PQKBWorkID)10263722
 (PQKB)10903997
 (DEHe213)9783540456780
 (MiAaPQ)EBC3072604
 (EXLCZ)991000000000211619
 Label
 Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references at the end of each chapters and index
 Carrier category
 online resource
 Carrier category code

 cr
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 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 × 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
 Dimensions
 unknown
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XIV, 790 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540456780
 Level of compression
 uncompressed
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/3540456783
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000211619
 (SSID)ssj0000321205
 (PQKBManifestationID)11220352
 (PQKBTitleCode)TC0000321205
 (PQKBWorkID)10263722
 (PQKB)10903997
 (DEHe213)9783540456780
 (MiAaPQ)EBC3072604
 (EXLCZ)991000000000211619
Subject
 Computer Communication Networks
 Computer communication systems
 Computer programming
 Computer science—Mathematics
 Computers
 Discrete Mathematics in Computer Science
 Programming Techniques
 Theory of Computation
 Algorithm Analysis and Problem Complexity
 Algorithms
 Computation by Abstract Devices
Member of
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
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.libraries.ou.edu/portal/AlgorithmsandComputation12thInternational/pPRgZFTQgR8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/AlgorithmsandComputation12thInternational/pPRgZFTQgR8/">Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma 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, edited by Peter Eades, Tadao Takaoka, (electronic resource)
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.libraries.ou.edu/portal/AlgorithmsandComputation12thInternational/pPRgZFTQgR8/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/AlgorithmsandComputation12thInternational/pPRgZFTQgR8/">Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 1921, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>