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  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings, edited by Mike Paterson, (electronic resource)
Algorithms  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings, edited by Mike Paterson, (electronic resource)
Resource Information
The item Algorithms  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings, edited by Mike Paterson, (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  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings, edited by Mike Paterson, (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.
 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, externalmemory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms
 Language

 eng
 eng
 Edition
 1st ed. 2000.
 Extent
 1 online resource (X, 450 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 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 kCut with Given Sizes of Parts
 Offline List Update is NPhard
 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 CircularArc Graphs
 Exact Point Pattern Matching and the Number of Congruent Triangles in a ThreeDimensional Pointset
 Range Searching over Tree Cross Products
 A 2 1/10Approximation Algorithm for a Generalization of the Weighted EdgeDominating Set Problem
 The Minimum Range Assignment Problem on Linear Radio Networks
 Property Testing in Computational Geometry
 On RTrees with Low Stabbing Number
 KD 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/OEfficient WellSeparated Pair Decomposition and Its Applications
 Higher Order Delaunay Triangulations
 On Representations of AlgebraicGeometric Codes for List Decoding
 Minimizing a Convex Cost Closure Set
 Preemptive Scheduling with Rejection
 Simpler and Faster VertexConnectivity Augmentation Algorithms
 Scheduling Broadcasts in Wireless Networks
 Jitter Regulation in an Internet Router with Delay Consideration
 Approximation of CurvatureConstrained 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 TwoLabel Point Labeling
 Analysing the Cache Behaviour of Nonuniform Distribution Sorting Algorithms
 How Helpers Hasten hRelations
 Computing Optimal Linear Layouts of Trees in Linear Time
 Coloring Sparse Random Graphs in Polynomial Average Time
 Restarts Can Help in the OnLine Minimization of the Maximum Delivery Time on a Single Machine
 Collision Detection Using Bounding Boxes: Convexity Helps
 Isbn
 9783540452539
 Label
 Algorithms  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings
 Title
 Algorithms  ESA 2000
 Title remainder
 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings
 Statement of responsibility
 edited by Mike Paterson
 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, externalmemory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms
 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.676.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 58, 2000 Proceedings, edited by Mike Paterson, (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 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 kCut with Given Sizes of Parts  Offline List Update is NPhard  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 CircularArc Graphs  Exact Point Pattern Matching and the Number of Congruent Triangles in a ThreeDimensional Pointset  Range Searching over Tree Cross Products  A 2 1/10Approximation Algorithm for a Generalization of the Weighted EdgeDominating Set Problem  The Minimum Range Assignment Problem on Linear Radio Networks  Property Testing in Computational Geometry  On RTrees with Low Stabbing Number  KD 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/OEfficient WellSeparated Pair Decomposition and Its Applications  Higher Order Delaunay Triangulations  On Representations of AlgebraicGeometric Codes for List Decoding  Minimizing a Convex Cost Closure Set  Preemptive Scheduling with Rejection  Simpler and Faster VertexConnectivity Augmentation Algorithms  Scheduling Broadcasts in Wireless Networks  Jitter Regulation in an Internet Router with Delay Consideration  Approximation of CurvatureConstrained 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 TwoLabel Point Labeling  Analysing the Cache Behaviour of Nonuniform Distribution Sorting Algorithms  How Helpers Hasten hRelations  Computing Optimal Linear Layouts of Trees in Linear Time  Coloring Sparse Random Graphs in Polynomial Average Time  Restarts Can Help in the OnLine 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/3540452532
 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
 (DEHe213)9783540452539
 (MiAaPQ)EBC3071876
 (EXLCZ)991000000000211290
 Label
 Algorithms  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings, edited by Mike Paterson, (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 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 kCut with Given Sizes of Parts  Offline List Update is NPhard  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 CircularArc Graphs  Exact Point Pattern Matching and the Number of Congruent Triangles in a ThreeDimensional Pointset  Range Searching over Tree Cross Products  A 2 1/10Approximation Algorithm for a Generalization of the Weighted EdgeDominating Set Problem  The Minimum Range Assignment Problem on Linear Radio Networks  Property Testing in Computational Geometry  On RTrees with Low Stabbing Number  KD 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/OEfficient WellSeparated Pair Decomposition and Its Applications  Higher Order Delaunay Triangulations  On Representations of AlgebraicGeometric Codes for List Decoding  Minimizing a Convex Cost Closure Set  Preemptive Scheduling with Rejection  Simpler and Faster VertexConnectivity Augmentation Algorithms  Scheduling Broadcasts in Wireless Networks  Jitter Regulation in an Internet Router with Delay Consideration  Approximation of CurvatureConstrained 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 TwoLabel Point Labeling  Analysing the Cache Behaviour of Nonuniform Distribution Sorting Algorithms  How Helpers Hasten hRelations  Computing Optimal Linear Layouts of Trees in Linear Time  Coloring Sparse Random Graphs in Polynomial Average Time  Restarts Can Help in the OnLine 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/3540452532
 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
 (DEHe213)9783540452539
 (MiAaPQ)EBC3071876
 (EXLCZ)991000000000211290
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 (Experimental)
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/AlgorithmsESA20008thAnnualEuropean/pxmajlBRzWw/" 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/AlgorithmsESA20008thAnnualEuropean/pxmajlBRzWw/">Algorithms  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings, edited by Mike Paterson, (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  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings, edited by Mike Paterson, (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/AlgorithmsESA20008thAnnualEuropean/pxmajlBRzWw/" 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/AlgorithmsESA20008thAnnualEuropean/pxmajlBRzWw/">Algorithms  ESA 2000 : 8th Annual European Symposium Saarbrücken, Germany, September 58, 2000 Proceedings, edited by Mike Paterson, (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>