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 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (electronic resource)
Algorithms  ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (electronic resource)
Resource Information
The item Algorithms  ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (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 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (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 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001. The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs
 Language

 eng
 eng
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XII, 544 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Invited Talks
 External Memory Data Structures
 Some Algorithmic Problems in Large Networks
 Exact and Approximate Distances in Graphs — A Survey
 Caching and Prefetching
 Strongly Competitive Algorithms for Caching with Pipelined Prefetching
 Duality between Prefetching and Queued Writing with Parallel Disks
 Online Algorithms
 Online Bin Coloring
 A General Decomposition Theorem for the kServer Problem
 Buying a Constant Competitive Ratio for Paging
 Data Structures I
 Simple Minimal Perfect Hashing in Less Space
 Cuckoo Hashing
 Optimization and Approximation
 Coupling Variable Fixing Algorithms for the Automatic Recording Problem
 Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints
 On the Approximability of the Minimum Test Collection Problem
 Sequences
 Finding Approximate Repetitions under Hamming Distance
 SNPs Problems, Complexity, and Algorithms
 Scheduling
 A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
 Grouping Techniques for Scheduling Problems: Simpler and Faster
 A 2Approximation Algorithm for the Multivehicle Scheduling Problem on a Path with Release and Handling Times
 Shortest Paths
 A Simple Shortest Path Algorithm with Linear Average Time
 A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms
 Geometry I
 A Separation Bound for Real Algebraic Expressions
 Property Testing with Geometric Queries
 Smallest ColorSpanning Objects
 Data Structures II
 Explicit Deterministic Constructions for Membership in the Bitprobe Model
 Lossy Dictionaries
 Geometry II
 Splitting a Delaunay Triangulation in Linear Time
 A Fast Algorithm for Approximating the Detour of a Polygonal Chain
 An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
 Distributed Algorithms
 Distributed O(? log n)EdgeColoring Algorithm
 Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation
 Graph Algorithms
 Computing Cycle Covers without Short Cycles
 A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
 Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows
 Pricing
 Fast Pricing of European Asian Options with Provable Accuracy: SingleStock and Basket Options
 Competitive Auctions for Multiple Digital Goods
 Broadcasting and Multicasting
 Algorithms for Efficient Filtering in ContentBased Multicast
 Approximation Algorithms for MinimumTime Broadcast under the VertexDisjoint Paths Mode
 Round Robin Is Optimal for FaultTolerant Broadcasting on Wireless Networks
 Graph Labeling and Graph Drawing
 Online and Offline Distance Constrained Labeling of Disk Graphs
 Approximate Distance Labeling Schemes
 On the Parameterized Complexity of Layered Graph Drawing
 Graphs
 A General Model of Undirected Web Graphs
 Packing Cycles and Cuts in Undirected Graphs
 Greedy Algorithms for Minimisation Problems in Random Regular Graphs
 Isbn
 9783540446767
 Label
 Algorithms  ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings
 Title
 Algorithms  ESA 2001
 Title remainder
 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings
 Statement of responsibility
 edited by Friedhelm Meyer auf der Heide
 Language

 eng
 eng
 Summary
 This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001. The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs
 http://bibfra.me/vocab/relation/corporateauthor
 5g2oplMEcw
 Dewey number
 005.1
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
 XZjxynxjo9A
 Image bit depth
 0
 Language note
 English
 LC call number
 QA76.676.66
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingName
 ESA '2001
 Nature of contents
 dictionaries
 http://bibfra.me/vocab/lite/organizationName
 ESA '2001
 http://library.link/vocab/relatedWorkOrContributorName

 ESA '2001
 Meyer auf der Heide, Friedhelm.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 2161
 http://library.link/vocab/subjectName

 Computer science
 Information theory
 Computer software
 Computational complexity
 Computer graphics
 Programming Techniques
 Theory of Computation
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Computation by Abstract Devices
 Computer Graphics
 Label
 Algorithms  ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 Invited Talks  External Memory Data Structures  Some Algorithmic Problems in Large Networks  Exact and Approximate Distances in Graphs — A Survey  Caching and Prefetching  Strongly Competitive Algorithms for Caching with Pipelined Prefetching  Duality between Prefetching and Queued Writing with Parallel Disks  Online Algorithms  Online Bin Coloring  A General Decomposition Theorem for the kServer Problem  Buying a Constant Competitive Ratio for Paging  Data Structures I  Simple Minimal Perfect Hashing in Less Space  Cuckoo Hashing  Optimization and Approximation  Coupling Variable Fixing Algorithms for the Automatic Recording Problem  Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints  On the Approximability of the Minimum Test Collection Problem  Sequences  Finding Approximate Repetitions under Hamming Distance  SNPs Problems, Complexity, and Algorithms  Scheduling  A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs  Grouping Techniques for Scheduling Problems: Simpler and Faster  A 2Approximation Algorithm for the Multivehicle Scheduling Problem on a Path with Release and Handling Times  Shortest Paths  A Simple Shortest Path Algorithm with Linear Average Time  A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms  Geometry I  A Separation Bound for Real Algebraic Expressions  Property Testing with Geometric Queries  Smallest ColorSpanning Objects  Data Structures II  Explicit Deterministic Constructions for Membership in the Bitprobe Model  Lossy Dictionaries  Geometry II  Splitting a Delaunay Triangulation in Linear Time  A Fast Algorithm for Approximating the Detour of a Polygonal Chain  An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee  Distributed Algorithms  Distributed O(? log n)EdgeColoring Algorithm  Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation  Graph Algorithms  Computing Cycle Covers without Short Cycles  A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth  Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows  Pricing  Fast Pricing of European Asian Options with Provable Accuracy: SingleStock and Basket Options  Competitive Auctions for Multiple Digital Goods  Broadcasting and Multicasting  Algorithms for Efficient Filtering in ContentBased Multicast  Approximation Algorithms for MinimumTime Broadcast under the VertexDisjoint Paths Mode  Round Robin Is Optimal for FaultTolerant Broadcasting on Wireless Networks  Graph Labeling and Graph Drawing  Online and Offline Distance Constrained Labeling of Disk Graphs  Approximate Distance Labeling Schemes  On the Parameterized Complexity of Layered Graph Drawing  Graphs  A General Model of Undirected Web Graphs  Packing Cycles and Cuts in Undirected Graphs  Greedy Algorithms for Minimisation Problems in Random Regular Graphs
 Dimensions
 unknown
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XII, 544 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540446767
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/3540446761
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000211558
 (SSID)ssj0000321190
 (PQKBManifestationID)11256251
 (PQKBTitleCode)TC0000321190
 (PQKBWorkID)10260434
 (PQKB)10913507
 (DEHe213)9783540446767
 (MiAaPQ)EBC3072169
 (EXLCZ)991000000000211558
 Label
 Algorithms  ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 Invited Talks  External Memory Data Structures  Some Algorithmic Problems in Large Networks  Exact and Approximate Distances in Graphs — A Survey  Caching and Prefetching  Strongly Competitive Algorithms for Caching with Pipelined Prefetching  Duality between Prefetching and Queued Writing with Parallel Disks  Online Algorithms  Online Bin Coloring  A General Decomposition Theorem for the kServer Problem  Buying a Constant Competitive Ratio for Paging  Data Structures I  Simple Minimal Perfect Hashing in Less Space  Cuckoo Hashing  Optimization and Approximation  Coupling Variable Fixing Algorithms for the Automatic Recording Problem  Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints  On the Approximability of the Minimum Test Collection Problem  Sequences  Finding Approximate Repetitions under Hamming Distance  SNPs Problems, Complexity, and Algorithms  Scheduling  A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs  Grouping Techniques for Scheduling Problems: Simpler and Faster  A 2Approximation Algorithm for the Multivehicle Scheduling Problem on a Path with Release and Handling Times  Shortest Paths  A Simple Shortest Path Algorithm with Linear Average Time  A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms  Geometry I  A Separation Bound for Real Algebraic Expressions  Property Testing with Geometric Queries  Smallest ColorSpanning Objects  Data Structures II  Explicit Deterministic Constructions for Membership in the Bitprobe Model  Lossy Dictionaries  Geometry II  Splitting a Delaunay Triangulation in Linear Time  A Fast Algorithm for Approximating the Detour of a Polygonal Chain  An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee  Distributed Algorithms  Distributed O(? log n)EdgeColoring Algorithm  Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation  Graph Algorithms  Computing Cycle Covers without Short Cycles  A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth  Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows  Pricing  Fast Pricing of European Asian Options with Provable Accuracy: SingleStock and Basket Options  Competitive Auctions for Multiple Digital Goods  Broadcasting and Multicasting  Algorithms for Efficient Filtering in ContentBased Multicast  Approximation Algorithms for MinimumTime Broadcast under the VertexDisjoint Paths Mode  Round Robin Is Optimal for FaultTolerant Broadcasting on Wireless Networks  Graph Labeling and Graph Drawing  Online and Offline Distance Constrained Labeling of Disk Graphs  Approximate Distance Labeling Schemes  On the Parameterized Complexity of Layered Graph Drawing  Graphs  A General Model of Undirected Web Graphs  Packing Cycles and Cuts in Undirected Graphs  Greedy Algorithms for Minimisation Problems in Random Regular Graphs
 Dimensions
 unknown
 Edition
 1st ed. 2001.
 Extent
 1 online resource (XII, 544 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540446767
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/3540446761
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000211558
 (SSID)ssj0000321190
 (PQKBManifestationID)11256251
 (PQKBTitleCode)TC0000321190
 (PQKBWorkID)10260434
 (PQKB)10913507
 (DEHe213)9783540446767
 (MiAaPQ)EBC3072169
 (EXLCZ)991000000000211558
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/AlgorithmsESA20019thAnnualEuropean/bW4IegnN0Lk/" 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/AlgorithmsESA20019thAnnualEuropean/bW4IegnN0Lk/">Algorithms  ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (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 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (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/AlgorithmsESA20019thAnnualEuropean/bW4IegnN0Lk/" 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/AlgorithmsESA20019thAnnualEuropean/bW4IegnN0Lk/">Algorithms  ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 2831, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (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>