↓ Skip to main content

Approximation and Online Algorithms

Overview of attention for book
Cover of 'Approximation and Online Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Improved Approximations for the Max k-Colored Clustering Problem
  3. Altmetric Badge
    Chapter 2 A $$o(n)$$ -Competitive Deterministic Algorithm for Online Matching on a Line
  4. Altmetric Badge
    Chapter 3 Better Algorithms for Online Bin Stretching
  5. Altmetric Badge
    Chapter 4 Online Colored Bin Packing
  6. Altmetric Badge
    Chapter 5 Improved Bound for Online Square-into-Square Packing
  7. Altmetric Badge
    Chapter 6 Improved Approximation Algorithm for Fault-Tolerant Facility Placement
  8. Altmetric Badge
    Chapter 7 The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem
  9. Altmetric Badge
    Chapter 8 Online Multi-Coloring with Advice
  10. Altmetric Badge
    Chapter 9 Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
  11. Altmetric Badge
    Chapter 10 Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
  12. Altmetric Badge
    Chapter 11 Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage
  13. Altmetric Badge
    Chapter 12 Linear-Time Approximation Algorithms for Geometric Intersection Graphs
  14. Altmetric Badge
    Chapter 13 The Minimum Feasible Tileset Problem
  15. Altmetric Badge
    Chapter 14 Online Ad Assignment with an Ad Exchange
  16. Altmetric Badge
    Chapter 15 Minimum Linear Arrangement of Series-Parallel Graphs
  17. Altmetric Badge
    Chapter 16 Online Dual Edge Coloring of Paths and Trees
  18. Altmetric Badge
    Chapter 17 Online Packet Scheduling Under Adversarial Jamming
  19. Altmetric Badge
    Chapter 18 Approximation and Online Algorithms
  20. Altmetric Badge
    Chapter 19 Steiner Trees with Bounded RC-Delay
  21. Altmetric Badge
    Chapter 20 Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms
  22. Altmetric Badge
    Chapter 21 Routing Under Uncertainty: The a priori Traveling Repairman Problem
  23. Altmetric Badge
    Chapter 22 Primal-Dual Algorithms for Precedence Constrained Covering Problems
Attention for Chapter 18: Approximation and Online Algorithms
Altmetric Badge

About this Attention Score

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

Mentioned by

twitter
5 X users

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
3 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
Approximation and Online Algorithms
Chapter number 18
Book title
Approximation and Online Algorithms
Published in
Lecture notes in computer science, January 2015
DOI 10.1007/978-3-319-18263-6_18
Book ISBNs
978-3-31-918262-9, 978-3-31-918263-6
Authors

Ojas Parekh, David Pritchard, Parekh, Ojas, Pritchard, David

X Demographics

X Demographics

The data shown below were collected from the profiles of 5 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Unspecified 1 33%
Student > Ph. D. Student 1 33%
Researcher 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Unspecified 1 33%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 2. 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 April 2016.
All research outputs
#13,973,215
of 22,860,626 outputs
Outputs from Lecture notes in computer science
#4,266
of 8,127 outputs
Outputs of similar age
#181,515
of 353,273 outputs
Outputs of similar age from Lecture notes in computer science
#146
of 257 outputs
Altmetric has tracked 22,860,626 research outputs across all sources so far. This one is in the 37th percentile – i.e., 37% 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 is in the 47th percentile – i.e., 47% of its peers scored the same or lower than it.
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 353,273 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 47th percentile – i.e., 47% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 257 others from the same source and published within six weeks on either side of this one. This one is in the 42nd percentile – i.e., 42% of its contemporaries scored the same or lower than it.