↓ Skip to main content

Algorithms — ESA 2001 : 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings

Overview of attention for book
Cover of 'Algorithms — ESA 2001 : 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 External Memory Data Structures
  3. Altmetric Badge
    Chapter 2 Some Algorithmic Problems in Large Networks
  4. Altmetric Badge
    Chapter 3 Exact and Approximate Distances in Graphs — A Survey
  5. Altmetric Badge
    Chapter 4 Strongly Competitive Algorithms for Caching with Pipelined Prefetching
  6. Altmetric Badge
    Chapter 5 Duality between Prefetching and Queued Writing with Parallel Disks
  7. Altmetric Badge
    Chapter 6 Online Bin Coloring
  8. Altmetric Badge
    Chapter 7 A General Decomposition Theorem for the k -Server Problem
  9. Altmetric Badge
    Chapter 8 Buying a Constant Competitive Ratio for Paging
  10. Altmetric Badge
    Chapter 9 Simple Minimal Perfect Hashing in Less Space
  11. Altmetric Badge
    Chapter 10 Cuckoo Hashing
  12. Altmetric Badge
    Chapter 11 Coupling Variable Fixing Algorithms for the Automatic Recording Problem
  13. Altmetric Badge
    Chapter 12 Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints
  14. Altmetric Badge
    Chapter 13 On the Approximability of the Minimum Test Collection Problem
  15. Altmetric Badge
    Chapter 14 Finding Approximate Repetitions under Hamming Distance
  16. Altmetric Badge
    Chapter 15 SNPs Problems, Complexity, and Algorithms
  17. Altmetric Badge
    Chapter 16 A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
  18. Altmetric Badge
    Chapter 17 Grouping Techniques for Scheduling Problems: Simpler and Faster
  19. Altmetric Badge
    Chapter 18 A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times
  20. Altmetric Badge
    Chapter 19 A Simple Shortest Path Algorithm with Linear Average Time
  21. Altmetric Badge
    Chapter 20 A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms
  22. Altmetric Badge
    Chapter 21 A Separation Bound for Real Algebraic Expressions
  23. Altmetric Badge
    Chapter 22 Property Testing with Geometric Queries
  24. Altmetric Badge
    Chapter 23 Smallest Color-Spanning Objects
  25. Altmetric Badge
    Chapter 24 Explicit Deterministic Constructions for Membership in the Bitprobe Model
  26. Altmetric Badge
    Chapter 25 Lossy Dictionaries
  27. Altmetric Badge
    Chapter 26 Splitting a Delaunay Triangulation in Linear Time
  28. Altmetric Badge
    Chapter 27 A Fast Algorithm for Approximating the Detour of a Polygonal Chain
  29. Altmetric Badge
    Chapter 28 An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
  30. Altmetric Badge
    Chapter 29 Distributed O ( Δ log n )-Edge-Coloring Algorithm
  31. Altmetric Badge
    Chapter 30 Modeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation
  32. Altmetric Badge
    Chapter 31 Computing Cycle Covers without Short Cycles
  33. Altmetric Badge
    Chapter 32 A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
  34. Altmetric Badge
    Chapter 33 Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows
  35. Altmetric Badge
    Chapter 34 Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options
  36. Altmetric Badge
    Chapter 35 Competitive Auctions for Multiple Digital Goods
  37. Altmetric Badge
    Chapter 36 Algorithms for Efficient Filtering in Content-Based Multicast
  38. Altmetric Badge
    Chapter 37 Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
  39. Altmetric Badge
    Chapter 38 Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
  40. Altmetric Badge
    Chapter 39 Online and Offline Distance Constrained Labeling of Disk Graphs
  41. Altmetric Badge
    Chapter 40 Approximate Distance Labeling Schemes
  42. Altmetric Badge
    Chapter 41 On the Parameterized Complexity of Layered Graph Drawing
  43. Altmetric Badge
    Chapter 42 A General Model of Undirected Web Graphs
  44. Altmetric Badge
    Chapter 43 Packing Cycles and Cuts in Undirected Graphs
  45. Altmetric Badge
    Chapter 44 Greedy Algorithms for Minimisation Problems in Random Regular Graphs
Attention for Chapter 35: Competitive Auctions for Multiple Digital Goods
Altmetric Badge

Mentioned by

wikipedia
4 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
17 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Competitive Auctions for Multiple Digital Goods
Chapter number 35
Book title
Algorithms — ESA 2001
Published in
Lecture notes in computer science, August 2001
DOI 10.1007/3-540-44676-1_35
Book ISBNs
978-3-54-042493-2, 978-3-54-044676-7
Authors

Andrew V. Goldberg, Jason D. Hartline, Goldberg, Andrew V., Hartline, Jason D.

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 17 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 8 47%
Student > Doctoral Student 4 24%
Researcher 2 12%
Student > Master 1 6%
Unknown 2 12%
Readers by discipline Count As %
Computer Science 9 53%
Business, Management and Accounting 2 12%
Engineering 2 12%
Economics, Econometrics and Finance 1 6%
Environmental Science 1 6%
Other 0 0%
Unknown 2 12%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 04 May 2020.
All research outputs
#7,452,489
of 22,783,848 outputs
Outputs from Lecture notes in computer science
#2,485
of 8,124 outputs
Outputs of similar age
#12,891
of 38,603 outputs
Outputs of similar age from Lecture notes in computer science
#12
of 36 outputs
Altmetric has tracked 22,783,848 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 38,603 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 11th percentile – i.e., 11% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 36 others from the same source and published within six weeks on either side of this one. This one is in the 25th percentile – i.e., 25% of its contemporaries scored the same or lower than it.