Algorithms and Computation (Record no. 92070)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 08831nam a22006375i 4500 |
001 - CONTROL NUMBER | |
control field | 978-3-540-30551-4 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | DE-He213 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240730183828.0 |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
fixed length control field | cr nn 008mamaa |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 110116s2005 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9783540305514 |
-- | 978-3-540-30551-4 |
024 7# - OTHER STANDARD IDENTIFIER | |
Standard number or code | 10.1007/b104582 |
Source of number or code | doi |
050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
Classification number | QA75.5-76.95 |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | UYA |
Source | bicssc |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | COM014000 |
Source | bisacsh |
072 #7 - SUBJECT CATEGORY CODE | |
Subject category code | UYA |
Source | thema |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 004.0151 |
Edition number | 23 |
245 10 - TITLE STATEMENT | |
Title | Algorithms and Computation |
Medium | [electronic resource] : |
Remainder of title | 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings / |
Statement of responsibility, etc. | edited by Rudolf Fleischer, Gerhard Trippen. |
250 ## - EDITION STATEMENT | |
Edition statement | 1st ed. 2005. |
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
Place of production, publication, distribution, manufacture | Berlin, Heidelberg : |
Name of producer, publisher, distributor, manufacturer | Springer Berlin Heidelberg : |
-- | Imprint: Springer, |
Date of production, publication, distribution, manufacture, or copyright notice | 2005. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | XVII, 935 p. |
Other physical details | online resource. |
336 ## - CONTENT TYPE | |
Content type term | text |
Content type code | txt |
Source | rdacontent |
337 ## - MEDIA TYPE | |
Media type term | computer |
Media type code | c |
Source | rdamedia |
338 ## - CARRIER TYPE | |
Carrier type term | online resource |
Carrier type code | cr |
Source | rdacarrier |
347 ## - DIGITAL FILE CHARACTERISTICS | |
File type | text file |
Encoding format | |
Source | rda |
490 1# - SERIES STATEMENT | |
Series statement | Lecture Notes in Computer Science, |
International Standard Serial Number | 1611-3349 ; |
Volume/sequential designation | 3341 |
505 0# - FORMATTED CONTENTS NOTE | |
Formatted contents note | Puzzles, Art, and Magic with Algorithms -- The ABCs of AVDs: Geometric Retrieval Made Simple -- Pareto Optimality in House Allocation Problems -- Property-Preserving Data Reconstruction -- On the Monotone Circuit Complexity of Quadratic Boolean Functions -- Generalized Function Matching -- Approximate Distance Oracles for Graphs with Dense Clusters -- Multicriteria Global Minimum Cuts -- Polyline Fitting of Planar Points Under Min-sum Criteria -- A Generalization of Magic Squares with Applications to Digital Halftoning -- Voronoi Diagrams with a Transportation Network on the Euclidean Plane -- Structural Alignment of Two RNA Sequences with Lagrangian Relaxation -- Poly-APX- and PTAS-Completeness in Standard and Differential Approximation -- Efficient Algorithms for k Maximum Sums -- Equipartitions of Measures by 2-Fans -- Augmenting the Edge-Connectivity of a Spider Tree -- On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks -- Structural Similarity in Graphs -- Flexibility of Steiner Trees in Uniform Orientation Metrics -- Random Access to Advice Strings and Collapsing Results -- Bounding the Payment of Approximate Truthful Mechanisms -- The Polymatroid Steiner Problems -- Geometric Optimization Problems Over Sliding Windows -- On-Line Windows Scheduling of Temporary Items -- Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy -- An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem -- On the Range Maximum-Sum Segment Query Problem -- An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs -- Efficient Job Scheduling Algorithms with Multi-type Contentions -- Superimposing Voronoi Complexes for Shape Deformation -- On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem -- Guarding Art Galleries by Guarding Witnesses -- On p-Norm Based Locality Measures of Space-Filling Curves -- Composability of Infinite-State Activity Automata -- Error Compensation in Leaf Root Problems -- On Compact and Efficient Routing in Certain Graph Classes -- Randomized Insertion and Deletion in Point Quad Trees -- Diagnosis in the Presence of Intermittent Faults -- Three-Round Adaptive Diagnosis in Binary n-Cubes -- Fast Algorithms for Comparison of Similar Unordered Trees -- GCD of Random Linear Forms -- On the Hardness and Easiness of Random 4-SAT Formulas -- Minimum Common String Partition Problem: Hardness and Approximations -- On the Complexity of Network Synchronization -- Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs -- Adaptive Spatial Partitioning for Multidimensional Data Streams -- Paired Pointset Traversal -- Approximated Two Choices in Randomized Load Balancing -- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting -- Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs -- The Maximum Agreement of Two Nested Phylogenetic Networks -- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations -- New Bounds on Map Labeling with Circular Labels -- Optimal Buffer Management via Resource Augmentation -- Oriented Paths in Mixed Graphs -- Polynomial Deterministic Rendezvous in Arbitrary Graphs -- Distributions of Points and Large Quadrangles -- Cutting Out Polygons with Lines and Rays -- Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays -- Inner Rectangular Drawings of Plane Graphs -- Approximating the Minmax Subtree Cover Problem in a Cactus -- Boundary-Optimal Triangulation Flooding.-Exact Computation of Polynomial Zeros Expressible by Square Roots -- Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements -- An O(nlog n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees -- Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks -- Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search -- Dynamic Tree Cross Products -- Spanners, Weak Spanners, and Power Spanners for Wireless Networks -- Techniques for Indexing and Querying Temporal Observations for a Collection of Objects -- Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices -- The Two-Guard Problem Revisited and Its Generalization -- Canonical Data Structure for Interval Probe Graphs -- Efficient Algorithms for the Longest Path Problem -- Randomized Algorithms for Motif Detection -- Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation -- Sweeping Graphs with Large Clique Number -- A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. |
520 ## - SUMMARY, ETC. | |
Summary, etc. | This volume contains the proceedings of the 15th Annual International Sym- sium on Algorithms and Computation (ISAAC 2004), held in Hong Kong, 20-22 December, 2004. In the past, it has been held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), and Kyoto (2003). ISAAC is an annual international symposium that covers a wide range of topics,namelyalgorithmsandcomputation.Themainpurposeofthesymposium is to provide a forum for researchers working in the active research community of algorithms and the theory of computation to present and exchange new ideas. In response to our call for papers we received 226 submissions. The task of selectingthepapersinthisvolumewasdonebyourprogramcommitteeandother referees. After a thorough review process the committee selected 76 papers, the decisions being based on originality and relevance to the ?eld of algorithms and computation. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications, with selected papers from ISAAC 2004 are in preparation. Thebeststudentpaperawardwillbegivenfor"Geometricoptimizationpr- lems over sliding windows" by Bashir S. Sadjad and Timothy M. Chan from the University of Waterloo. Two eminent invited speakers, Prof. Erik D. Demaine, MIT, and Prof. David M. Mount, University of Maryland, also contributed to this volume. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer science. |
9 (RLIN) | 9832 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Algorithms. |
9 (RLIN) | 3390 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer science |
General subdivision | Mathematics. |
9 (RLIN) | 3866 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Discrete mathematics. |
9 (RLIN) | 12873 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Numerical analysis. |
9 (RLIN) | 4603 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer networks . |
9 (RLIN) | 31572 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer graphics. |
9 (RLIN) | 4088 |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Theory of Computation. |
9 (RLIN) | 133634 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Algorithms. |
9 (RLIN) | 3390 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Discrete Mathematics in Computer Science. |
9 (RLIN) | 31837 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Numerical Analysis. |
9 (RLIN) | 4603 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer Communication Networks. |
9 (RLIN) | 133635 |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name entry element | Computer Graphics. |
9 (RLIN) | 4088 |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Fleischer, Rudolf. |
Relator term | editor. |
Relationship | edt |
-- | http://id.loc.gov/vocabulary/relators/edt |
9 (RLIN) | 133636 |
700 1# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Trippen, Gerhard. |
Relator term | editor. |
Relationship | edt |
-- | http://id.loc.gov/vocabulary/relators/edt |
9 (RLIN) | 133637 |
710 2# - ADDED ENTRY--CORPORATE NAME | |
Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
9 (RLIN) | 133638 |
773 0# - HOST ITEM ENTRY | |
Title | Springer Nature eBook |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Relationship information | Printed edition: |
International Standard Book Number | 9783540241317 |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
Relationship information | Printed edition: |
International Standard Book Number | 9783540806233 |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
Uniform title | Lecture Notes in Computer Science, |
International Standard Serial Number | 1611-3349 ; |
Volume/sequential designation | 3341 |
9 (RLIN) | 23263 |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="https://doi.org/10.1007/b104582">https://doi.org/10.1007/b104582</a> |
912 ## - | |
-- | ZDB-2-SCS |
912 ## - | |
-- | ZDB-2-SXCS |
912 ## - | |
-- | ZDB-2-LNC |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks-Lecture Notes in CS |
No items available.