The Resource Algorithms - ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings, edited by Mike Paterson, (electronic resource)

Algorithms - ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings, edited by Mike Paterson, (electronic resource)

Label
Algorithms - ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings
Title
Algorithms - ESA 2000
Title remainder
8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings
Statement of responsibility
edited by Mike Paterson
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Summary
This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrücken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms
Member of
http://bibfra.me/vocab/relation/corporateauthor
2Php8mWmd8g
Dewey number
004/.01/5118
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
b2lbi5p9lOk
Image bit depth
0
Language note
English
LC call number
QA76.6-76.66
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingName
ESA 2000
Nature of contents
dictionaries
http://bibfra.me/vocab/lite/organizationName
ESA 2000
http://library.link/vocab/relatedWorkOrContributorName
  • ESA 2000
  • Paterson, Mike.
Series statement
Lecture Notes in Computer Science,
Series volume
1879
http://library.link/vocab/subjectName
  • Computer science
  • Data structures (Computer scienc
  • Computer software
  • Computer graphics
  • Programming Techniques
  • Data Structures and Information Theory
  • Computer Applications
  • Algorithm Analysis and Problem Complexity
  • Data Structures
  • Computer Graphics
Label
Algorithms - ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings, edited by Mike Paterson, (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 Papers -- Web Information Retrieval - an Algorithmic Perspective -- Computational Biology — Algorithms and More -- Contributed Papers -- Polygon Decomposition for Efficient Construction of Minkowski Sums -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts -- Offline List Update is NP-hard -- Computing Largest Common Point Sets under Approximate Congruence -- Online Algorithms for Caching Multimedia Streams -- On Recognizing Cayley Graphs -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset -- Range Searching over Tree Cross Products -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem -- The Minimum Range Assignment Problem on Linear Radio Networks -- Property Testing in Computational Geometry -- On R-Trees with Low Stabbing Number -- K-D Trees Are Better when Cut on the Longest Side -- On Multicriteria Online Problems -- Online Scheduling Revisited -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications -- Higher Order Delaunay Triangulations -- On Representations of Algebraic-Geometric Codes for List Decoding -- Minimizing a Convex Cost Closure Set -- Preemptive Scheduling with Rejection -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms -- Scheduling Broadcasts in Wireless Networks -- Jitter Regulation in an Internet Router with Delay Consideration -- Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points -- Resource Constrained Shortest Paths -- On the Competitiveness of Linear Search -- Maintaining a Minimum Spanning Tree under Transient Node Failures -- Minimum Depth Graph Embedding -- New Algorithms for Two-Label Point Labeling -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms -- How Helpers Hasten h-Relations -- Computing Optimal Linear Layouts of Trees in Linear Time -- Coloring Sparse Random Graphs in Polynomial Average Time -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine -- Collision Detection Using Bounding Boxes: Convexity Helps
Dimensions
unknown
Edition
1st ed. 2000.
Extent
1 online resource (X, 450 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540452539
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/3-540-45253-2
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000211290
  • (SSID)ssj0000321189
  • (PQKBManifestationID)11256250
  • (PQKBTitleCode)TC0000321189
  • (PQKBWorkID)10263098
  • (PQKB)10172761
  • (DE-He213)978-3-540-45253-9
  • (MiAaPQ)EBC3071876
  • (EXLCZ)991000000000211290
Label
Algorithms - ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings, edited by Mike Paterson, (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 Papers -- Web Information Retrieval - an Algorithmic Perspective -- Computational Biology — Algorithms and More -- Contributed Papers -- Polygon Decomposition for Efficient Construction of Minkowski Sums -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts -- Offline List Update is NP-hard -- Computing Largest Common Point Sets under Approximate Congruence -- Online Algorithms for Caching Multimedia Streams -- On Recognizing Cayley Graphs -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset -- Range Searching over Tree Cross Products -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem -- The Minimum Range Assignment Problem on Linear Radio Networks -- Property Testing in Computational Geometry -- On R-Trees with Low Stabbing Number -- K-D Trees Are Better when Cut on the Longest Side -- On Multicriteria Online Problems -- Online Scheduling Revisited -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications -- Higher Order Delaunay Triangulations -- On Representations of Algebraic-Geometric Codes for List Decoding -- Minimizing a Convex Cost Closure Set -- Preemptive Scheduling with Rejection -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms -- Scheduling Broadcasts in Wireless Networks -- Jitter Regulation in an Internet Router with Delay Consideration -- Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points -- Resource Constrained Shortest Paths -- On the Competitiveness of Linear Search -- Maintaining a Minimum Spanning Tree under Transient Node Failures -- Minimum Depth Graph Embedding -- New Algorithms for Two-Label Point Labeling -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms -- How Helpers Hasten h-Relations -- Computing Optimal Linear Layouts of Trees in Linear Time -- Coloring Sparse Random Graphs in Polynomial Average Time -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine -- Collision Detection Using Bounding Boxes: Convexity Helps
Dimensions
unknown
Edition
1st ed. 2000.
Extent
1 online resource (X, 450 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540452539
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/3-540-45253-2
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000211290
  • (SSID)ssj0000321189
  • (PQKBManifestationID)11256250
  • (PQKBTitleCode)TC0000321189
  • (PQKBWorkID)10263098
  • (PQKB)10172761
  • (DE-He213)978-3-540-45253-9
  • (MiAaPQ)EBC3071876
  • (EXLCZ)991000000000211290

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 ...