↓ 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 Some Easy and Some Not so Easy Geometric Optimization Problems
  3. Altmetric Badge
    Chapter 2 Deterministic Min-Cost Matching with Delays
  4. Altmetric Badge
    Chapter 3 Sequential Metric Dimension
  5. Altmetric Badge
    Chapter 4 A Primal-Dual Online Deterministic Algorithm for Matching with Delays
  6. Altmetric Badge
    Chapter 5 Advice Complexity of Priority Algorithms
  7. Altmetric Badge
    Chapter 6 Approximating Node-Weighted k -MST on Planar Graphs
  8. Altmetric Badge
    Chapter 7 Exploring Sparse Graphs with Advice (Extended Abstract)
  9. Altmetric Badge
    Chapter 8 Call Admission Problems on Grids with Advice (Extended Abstract)
  10. Altmetric Badge
    Chapter 9 Improved Approximation Algorithms for Minimum Power Covering Problems
  11. Altmetric Badge
    Chapter 10 DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
  12. Altmetric Badge
    Chapter 11 Strategic Contention Resolution in Multiple Channels
  13. Altmetric Badge
    Chapter 12 Sublinear Graph Augmentation for Fast Query Implementation
  14. Altmetric Badge
    Chapter 13 Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy
  15. Altmetric Badge
    Chapter 14 Probabilistic Embeddings of the Fréchet Distance
  16. Altmetric Badge
    Chapter 15 Algorithms for Dynamic NFV Workload
  17. Altmetric Badge
    Chapter 16 Longest Increasing Subsequence Under Persistent Comparison Errors
  18. Altmetric Badge
    Chapter 17 Cut Sparsifiers for Balanced Digraphs
  19. Altmetric Badge
    Chapter 18 Reconfiguration of Graphs with Connectivity Constraints
  20. Altmetric Badge
    Chapter 19 The Itinerant List Update Problem
  21. Altmetric Badge
    Chapter 20 The Price of Fixed Assignments in Stochastic Extensible Bin Packing
Attention for Chapter 10: DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
Altmetric Badge

Mentioned by

twitter
2 X users

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
5 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
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
Chapter number 10
Book title
Approximation and Online Algorithms
Published in
arXiv, August 2018
DOI 10.1007/978-3-030-04693-4_10
Book ISBNs
978-3-03-004692-7, 978-3-03-004693-4
Authors

Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky, Chang, Minjun, Hochbaum, Dorit S., Spaen, Quico, Velednitsky, Mark

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

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 2 40%
Student > Ph. D. Student 1 20%
Unknown 2 40%
Readers by discipline Count As %
Computer Science 2 40%
Decision Sciences 1 20%
Unknown 2 40%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 16 October 2018.
All research outputs
#19,519,579
of 24,002,307 outputs
Outputs from arXiv
#589,022
of 1,011,770 outputs
Outputs of similar age
#261,895
of 337,510 outputs
Outputs of similar age from arXiv
#19,453
of 24,163 outputs
Altmetric has tracked 24,002,307 research outputs across all sources so far. This one is in the 10th percentile – i.e., 10% of other outputs scored the same or lower than it.
So far Altmetric has tracked 1,011,770 research outputs from this source. They receive a mean Attention Score of 4.0. This one is in the 25th percentile – i.e., 25% 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 337,510 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 12th percentile – i.e., 12% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 24,163 others from the same source and published within six weeks on either side of this one. This one is in the 9th percentile – i.e., 9% of its contemporaries scored the same or lower than it.