↓ Skip to main content

Algorithms - ESA 2000

Overview of attention for book
Cover of 'Algorithms - ESA 2000'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Web Information Retrieval - an Algorithmic Perspective
  3. Altmetric Badge
    Chapter 2 Computational Biology — Algorithms and More
  4. Altmetric Badge
    Chapter 3 Algorithms - ESA 2000
  5. Altmetric Badge
    Chapter 4 An Approximation Algorithm for Hypergraph Max k -Cut with Given Sizes of Parts
  6. Altmetric Badge
    Chapter 5 Offline List Update is NP-hard
  7. Altmetric Badge
    Chapter 6 Computing Largest Common Point Sets under Approximate Congruence
  8. Altmetric Badge
    Chapter 7 Online Algorithms for Caching Multimedia Streams
  9. Altmetric Badge
    Chapter 8 On Recognizing Cayley Graphs
  10. Altmetric Badge
    Chapter 9 Fast Algorithms for Even/Odd Minimum Cuts and Generalizations
  11. Altmetric Badge
    Chapter 10 Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
  12. Altmetric Badge
    Chapter 11 Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset
  13. Altmetric Badge
    Chapter 12 Range Searching over Tree Cross Products
  14. Altmetric Badge
    Chapter 13 A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
  15. Altmetric Badge
    Chapter 14 The Minimum Range Assignment Problem on Linear Radio Networks
  16. Altmetric Badge
    Chapter 15 Property Testing in Computational Geometry
  17. Altmetric Badge
    Chapter 16 On R-Trees with Low Stabbing Number
  18. Altmetric Badge
    Chapter 17 K-D Trees Are Better when Cut on the Longest Side
  19. Altmetric Badge
    Chapter 18 On Multicriteria Online Problems
  20. Altmetric Badge
    Chapter 19 Online Scheduling Revisited
  21. Altmetric Badge
    Chapter 20 Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
  22. Altmetric Badge
    Chapter 21 I/O-Efficient Well-Separated Pair Decomposition and Its Applications
  23. Altmetric Badge
    Chapter 22 Higher Order Delaunay Triangulations
  24. Altmetric Badge
    Chapter 23 On Representations of Algebraic-Geometric Codes for List Decoding
  25. Altmetric Badge
    Chapter 24 Minimizing a Convex Cost Closure Set
  26. Altmetric Badge
    Chapter 25 Preemptive Scheduling with Rejection
  27. Altmetric Badge
    Chapter 26 Simpler and Faster Vertex-Connectivity Augmentation Algorithms
  28. Altmetric Badge
    Chapter 27 Scheduling Broadcasts in Wireless Networks
  29. Altmetric Badge
    Chapter 28 Jitter Regulation in an Internet Router with Delay Consideration
  30. Altmetric Badge
    Chapter 29 Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points
  31. Altmetric Badge
    Chapter 30 Resource Constrained Shortest Paths
  32. Altmetric Badge
    Chapter 31 On the Competitiveness of Linear Search
  33. Altmetric Badge
    Chapter 32 Maintaining a Minimum Spanning Tree under Transient Node Failures
  34. Altmetric Badge
    Chapter 33 Minimum Depth Graph Embedding
  35. Altmetric Badge
    Chapter 34 New Algorithms for Two-Label Point Labeling
  36. Altmetric Badge
    Chapter 35 Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms
  37. Altmetric Badge
    Chapter 36 How Helpers Hasten h -Relations
  38. Altmetric Badge
    Chapter 37 Computing Optimal Linear Layouts of Trees in Linear Time
  39. Altmetric Badge
    Chapter 38 Coloring Sparse Random Graphs in Polynomial Average Time
  40. Altmetric Badge
    Chapter 39 Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine
  41. Altmetric Badge
    Chapter 40 Collision Detection Using Bounding Boxes: Convexity Helps
Attention for Chapter 19: Online Scheduling Revisited
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
19 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
Online Scheduling Revisited
Chapter number 19
Book title
Algorithms - ESA 2000
Published in
Lecture notes in computer science, September 2000
DOI 10.1007/3-540-45253-2_19
Book ISBNs
978-3-54-041004-1, 978-3-54-045253-9
Authors

Rudolf Fleischer, Michaela Wahl, Fleischer, Rudolf, Wahl, Michaela

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Switzerland 1 5%
Unknown 18 95%

Demographic breakdown

Readers by professional status Count As %
Professor 4 21%
Student > Master 4 21%
Professor > Associate Professor 3 16%
Student > Ph. D. Student 3 16%
Student > Bachelor 2 11%
Other 2 11%
Unknown 1 5%
Readers by discipline Count As %
Computer Science 12 63%
Environmental Science 1 5%
Mathematics 1 5%
Engineering 1 5%
Unknown 4 21%
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 13 February 2020.
All research outputs
#7,454,298
of 22,789,076 outputs
Outputs from Lecture notes in computer science
#2,486
of 8,127 outputs
Outputs of similar age
#12,300
of 37,054 outputs
Outputs of similar age from Lecture notes in computer science
#3
of 14 outputs
Altmetric has tracked 22,789,076 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,127 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 37,054 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 10th percentile – i.e., 10% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 14 others from the same source and published within six weeks on either side of this one. This one is in the 35th percentile – i.e., 35% of its contemporaries scored the same or lower than it.