skip to content
Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001 : proceedings Preview this item
ClosePreview this item
Checking...

Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001 : proceedings

Author: 高岡, 忠雄. ; ; Peter Eades; Tadao Takaoka
Publisher: Berlin : Springer, 2001.
Series: Lecture notes in computer science, 2223.
Edition/Format:   Print book : Conference publication : EnglishView all editions and formats
Summary:

This text contains the proceedings of the 12th International Conference on Algorithms and Computation, held in New Zealand in 2001. Topics covered include combinatorial generation and optimization,  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Christchurch (2001)
Conference papers and proceedings
Kongress
Congresses
Congrès
Material Type: Conference publication, Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: 高岡, 忠雄. ; ; Peter Eades; Tadao Takaoka
ISBN: 3540429859 9783540429852
OCLC Number: 48621378
Description: xiv, 780 pages : illustrations ; 24 cm.
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 x 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.
Series Title: Lecture notes in computer science, 2223.
Other Titles: ISAAC 2001
Responsibility: Peter Eades, Tadao Takaoka (eds.).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/48621378> # Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001 : proceedings
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "48621378" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/203638212#Place/berlin> ; # Berlin
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/computer_algorithms> ; # Computer algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/computerwiskunde> ; # Computerwiskunde
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/algorithmes> ; # Algorithmes
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/algoritmen> ; # Algoritmen
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/algorithmische_geometrie> ; # Algorithmische Geometrie
   schema:about <http://id.worldcat.org/fast/1041290> ; # Numerical calculations--Data processing
   schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/datenstruktur> ; # Datenstruktur
   schema:about <http://dewey.info/class/004.015118/e21/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/calculs_numeriques_informatique> ; # Calculs numériques--Informatique
   schema:about <http://id.loc.gov/authorities/subjects/sh2010104021> ; # Numerical calculations--Data processing
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/algorithmus> ; # Algorithmus
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/kongress> ; # Kongress
   schema:about <http://experiment.worldcat.org/entity/work/data/203638212#Topic/complexiteit> ; # Complexiteit
   schema:alternateName "ISAAC 2001" ;
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/66074337> ; # 忠雄 高岡
   schema:contributor <http://viaf.org/viaf/277310794> ; # Tadao Takaoka
   schema:creator <http://experiment.worldcat.org/entity/work/data/203638212#Meeting/isaac_conference_12th_2001_christchurch_new_zealand> ; # ISAAC (Conference) (12th : 2001 : Christchurch, New Zealand)
   schema:datePublished "2001" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/203638212> ;
   schema:genre "Christchurch (2001)"@en ;
   schema:genre "Kongress"@en ;
   schema:genre "Conference papers and proceedings"@en ;
   schema:genre "Conference publication"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
   schema:name "Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001 : proceedings"@en ;
   schema:productID "48621378" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/48621378#PublicationEvent/berlin_springer_2001> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/203638212#Agent/springer> ; # Springer
   schema:url <http://dx.doi.org/10.1007/3-540-45678-3> ;
   schema:url <http://www.springerlink.com/link.asp?id=rbl7v2v6npq6du0h> ;
   schema:url <http://link.springer.com/10.1007/3-540-45678-3> ;
   schema:url <http://swbplus.bsz-bw.de/bsz096053968cov.htm> ;
   schema:url <http://link.springer-ny.com/link/service/series/0558/tocs/t2223.htm> ;
   schema:url <http://link.springer.de/link/service/series/0558/tocs/t2223.htm> ;
   schema:workExample <http://worldcat.org/isbn/9783540429852> ;
   umbel:isLike <http://d-nb.info/963118196> ;
   umbel:isLike <http://bnb.data.bl.uk/id/resource/GBA204139> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/48621378> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/203638212#Meeting/isaac_conference_12th_2001_christchurch_new_zealand> # ISAAC (Conference) (12th : 2001 : Christchurch, New Zealand)
    a bgn:Meeting, schema:Event ;
   schema:location <http://experiment.worldcat.org/entity/work/data/203638212#Place/christchurch_new_zealand> ; # Christchurch, New Zealand)
   schema:name "ISAAC (Conference) (12th : 2001 : Christchurch, New Zealand)" ;
    .

<http://experiment.worldcat.org/entity/work/data/203638212#Place/christchurch_new_zealand> # Christchurch, New Zealand)
    a schema:Place ;
   schema:name "Christchurch, New Zealand)" ;
    .

<http://experiment.worldcat.org/entity/work/data/203638212#Topic/algorithmische_geometrie> # Algorithmische Geometrie
    a schema:Intangible ;
   schema:name "Algorithmische Geometrie"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/203638212#Topic/calculs_numeriques_informatique> # Calculs numériques--Informatique
    a schema:Intangible ;
   schema:name "Calculs numériques--Informatique"@fr ;
    .

<http://id.loc.gov/authorities/subjects/sh2010104021> # Numerical calculations--Data processing
    a schema:Intangible ;
   schema:name "Numerical calculations--Data processing"@en ;
    .

<http://id.worldcat.org/fast/1041290> # Numerical calculations--Data processing
    a schema:Intangible ;
   schema:name "Numerical calculations--Data processing"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://link.springer.com/10.1007/3-540-45678-3>
   rdfs:comment "eBook available for UOIT via SpringerLink. Click link to access" ;
    .

<http://link.springer-ny.com/link/service/series/0558/tocs/t2223.htm>
   rdfs:comment "Restricted to Springer LINK subscribers" ;
    .

<http://viaf.org/viaf/277310794> # Tadao Takaoka
    a schema:Person ;
   schema:birthDate "1943" ;
   schema:familyName "Takaoka" ;
   schema:givenName "Tadao" ;
   schema:name "Tadao Takaoka" ;
    .

<http://viaf.org/viaf/66074337> # 忠雄 高岡
    a schema:Person ;
   schema:familyName "Eades" ;
   schema:givenName "Peter" ;
   schema:name "忠雄 高岡"@en ;
   schema:name "Peter Eades"@en ;
    .

<http://worldcat.org/isbn/9783540429852>
    a schema:ProductModel ;
   schema:isbn "3540429859" ;
   schema:isbn "9783540429852" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/48621378> ; # Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001 : proceedings
   schema:issn "0302-9743" ;
   schema:name "Lecture notes in computer science ;" ;
   schema:name "Lecture notes in computer science," ;
    .

<http://www.springerlink.com/link.asp?id=rbl7v2v6npq6du0h>
   rdfs:comment "Access restricted to Rutgers University faculty, staff, and students" ;
   rdfs:comment "Electronic version:" ;
    .

<http://www.worldcat.org/title/-/oclc/48621378>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/48621378> ; # Algorithms and computation : 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001 : proceedings
   schema:dateModified "2017-12-25" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.