The Resource Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (electronic resource)

Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (electronic resource)

Label
Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings
Title
Algorithms - ESA 2001
Title remainder
9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings
Statement of responsibility
edited by Friedhelm Meyer auf der Heide
Creator
Contributor
Editor
Editor
Subject
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
Member of
http://bibfra.me/vocab/relation/corporateauthor
5g2oplME-cw
Dewey number
005.1
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
XZjxynxjo9A
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 '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 28-31, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (electronic resource)
Instantiates
Publication
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 k-Server 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 2-Approximation Algorithm for the Multi-vehicle 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 Color-Spanning 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)-Edge-Coloring 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: Single-Stock and Basket Options -- Competitive Auctions for Multiple Digital Goods -- Broadcasting and Multicasting -- Algorithms for Efficient Filtering in Content-Based Multicast -- Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode -- Round Robin Is Optimal for Fault-Tolerant 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/3-540-44676-1
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
  • (DE-He213)978-3-540-44676-7
  • (MiAaPQ)EBC3072169
  • (EXLCZ)991000000000211558
Label
Algorithms - ESA 2001 : 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, edited by Friedhelm Meyer auf der Heide, (electronic resource)
Publication
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 k-Server 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 2-Approximation Algorithm for the Multi-vehicle 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 Color-Spanning 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)-Edge-Coloring 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: Single-Stock and Basket Options -- Competitive Auctions for Multiple Digital Goods -- Broadcasting and Multicasting -- Algorithms for Efficient Filtering in Content-Based Multicast -- Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode -- Round Robin Is Optimal for Fault-Tolerant 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/3-540-44676-1
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
  • (DE-He213)978-3-540-44676-7
  • (MiAaPQ)EBC3072169
  • (EXLCZ)991000000000211558

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