The Resource Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)

Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)

Label
Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings
Title
Algorithms and Computation
Title remainder
12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings
Statement of responsibility
edited by Peter Eades, Tadao Takaoka
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
Dewey number
005.11
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • a1zoXQiBYbs
  • Jmq57ObiH6k
Image bit depth
0
Language note
English
LC call number
QA76.6-76.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 19-21, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)
Instantiates
Publication
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 M-Convex 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 Multi-vehicle Scheduling Problem on a Path with Release and Handling Times -- Semi-normal Schedulings: Improvement on Goemans’ Algorithm -- Parallel and Distributed Algorithms (I) -- Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness -- Broadcasting with Universal Lists Revisited: Using Competitive Analysis -- On Adaptive Fault Diagnosis for Multiprocessor Systems -- On-Line Multicasting in All-Optical Networks -- Graph Drawing and Algorithms (I) -- Enumerating Floorplans with n Rooms -- On Min-Max Cycle Bases -- On the Minimum Local-Vertex-Connectivity 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 Pseudo-Euclidean Spaces -- Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees -- Tree-Approximations for the Weighted Cost-Distance 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 -- Polynomial-Time Algorithms for the Equivalence for One-Way 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 P4-Comparability Graphs -- Efficient Algorithms for k-Terminal Cuts on Planar Graphs -- Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths -- Combinatorial Generation and Optimization (II) -- Algorithms for Pattern Involvement in Permutations -- A Fast Algorithm for Enumerating Bipartite Perfect Matchings -- On-Line 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 Self-Assembly 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 Series-Parallel Graphs -- Go with the Winners Algorithms for Cliques in Random Graphs -- Complexity of Partial Covers of Graphs -- On Game-Theoretic 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 × 2-Discrepancy -- 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 -- On-Line Algorithms for Cardinality Constrained Bin Packing Problems -- Computational Biology and String Matching (II) -- Suffix Vector: A Space-Efficient 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 Cent-dian Path Problem on Tree Networks -- Approximate Hotlink Assignment -- Efficient Algorithms for Two Generalized 2-Median 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/3-540-45678-3
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
  • (DE-He213)978-3-540-45678-0
  • (MiAaPQ)EBC3072604
  • (EXLCZ)991000000000211619
Label
Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings, edited by Peter Eades, Tadao Takaoka, (electronic resource)
Publication
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 M-Convex 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 Multi-vehicle Scheduling Problem on a Path with Release and Handling Times -- Semi-normal Schedulings: Improvement on Goemans’ Algorithm -- Parallel and Distributed Algorithms (I) -- Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness -- Broadcasting with Universal Lists Revisited: Using Competitive Analysis -- On Adaptive Fault Diagnosis for Multiprocessor Systems -- On-Line Multicasting in All-Optical Networks -- Graph Drawing and Algorithms (I) -- Enumerating Floorplans with n Rooms -- On Min-Max Cycle Bases -- On the Minimum Local-Vertex-Connectivity 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 Pseudo-Euclidean Spaces -- Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees -- Tree-Approximations for the Weighted Cost-Distance 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 -- Polynomial-Time Algorithms for the Equivalence for One-Way 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 P4-Comparability Graphs -- Efficient Algorithms for k-Terminal Cuts on Planar Graphs -- Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths -- Combinatorial Generation and Optimization (II) -- Algorithms for Pattern Involvement in Permutations -- A Fast Algorithm for Enumerating Bipartite Perfect Matchings -- On-Line 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 Self-Assembly 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 Series-Parallel Graphs -- Go with the Winners Algorithms for Cliques in Random Graphs -- Complexity of Partial Covers of Graphs -- On Game-Theoretic 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 × 2-Discrepancy -- 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 -- On-Line Algorithms for Cardinality Constrained Bin Packing Problems -- Computational Biology and String Matching (II) -- Suffix Vector: A Space-Efficient 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 Cent-dian Path Problem on Tree Networks -- Approximate Hotlink Assignment -- Efficient Algorithms for Two Generalized 2-Median 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/3-540-45678-3
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
  • (DE-He213)978-3-540-45678-0
  • (MiAaPQ)EBC3072604
  • (EXLCZ)991000000000211619

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...