↓ 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 Approximation Ineffectiveness of a Tour-Untangling Heuristic
  3. Altmetric Badge
    Chapter 2 A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities
  4. Altmetric Badge
    Chapter 3 Approximating Maximum Edge 2-Coloring by Normalizing Graphs
  5. Altmetric Badge
    Chapter 4 An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem
  6. Altmetric Badge
    Chapter 5 Greedy Minimum-Energy Scheduling
  7. Altmetric Badge
    Chapter 6 Scheduling with Speed Predictions
  8. Altmetric Badge
    Chapter 7 The Power of Amortization on Scheduling with Explorable Uncertainty
  9. Altmetric Badge
    Chapter 8 Total Completion Time Scheduling Under Scenarios
  10. Altmetric Badge
    Chapter 9 Approximating Fair k -Min-Sum-Radii in Euclidean Space
  11. Altmetric Badge
    Chapter 10 Online Hitting Set of  d -Dimensional Fat Objects
  12. Altmetric Badge
    Chapter 11 Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes
  13. Altmetric Badge
    Chapter 12 Hitting Sets when the Shallow Cell Complexity is Small
  14. Altmetric Badge
    Chapter 13 Any-Order Online Interval Selection
  15. Altmetric Badge
    Chapter 14 Improved Approximations for Relative Survivable Network Design
  16. Altmetric Badge
    Chapter 15 Independent Set in  k -Claw-Free Graphs: Conditional $$\chi $$ -Boundedness and the Power of LP/SDP Relaxations
  17. Altmetric Badge
    Chapter 16 Fast Parallel Algorithms for Submodular p -Superseparable Maximization
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Good Attention Score compared to outputs of the same age and source (77th percentile)

Mentioned by

twitter
2 X users
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.
Title
Approximation and Online Algorithms
Published by
arXiv, January 2024
DOI 10.1007/978-3-031-49815-2
ISBNs
978-3-03-149814-5, 978-3-03-149815-2
Authors

Philip Cervenjak, Junhao Gan, Anthony Wirth

Editors

Byrka, Jarosław, Wiese, Andreas

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
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 05 February 2024.
All research outputs
#17,282,278
of 25,436,226 outputs
Outputs from arXiv
#355,126
of 918,918 outputs
Outputs of similar age
#173,755
of 333,165 outputs
Outputs of similar age from arXiv
#8,321
of 38,027 outputs
Altmetric has tracked 25,436,226 research outputs across all sources so far. This one is in the 31st percentile – i.e., 31% of other outputs scored the same or lower than it.
So far Altmetric has tracked 918,918 research outputs from this source. They receive a mean Attention Score of 4.3. This one has gotten more attention than average, scoring higher than 61% 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 333,165 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 38,027 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 77% of its contemporaries.