↓ 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 The Primal-Dual Approach for Online Algorithms
  3. Altmetric Badge
    Chapter 2 Independent Set with Advice: The Impact of Graph Knowledge
  4. Altmetric Badge
    Chapter 3 Online Multi-Commodity Flow with High Demands
  5. Altmetric Badge
    Chapter 4 Approximating Spanning Trees with Few Branches
  6. Altmetric Badge
    Chapter 5 On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters
  7. Altmetric Badge
    Chapter 6 Online Exploration of Polygons with Holes
  8. Altmetric Badge
    Chapter 7 Probabilistic k-Median Clustering in Data Streams
  9. Altmetric Badge
    Chapter 8 Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs
  10. Altmetric Badge
    Chapter 9 On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods
  11. Altmetric Badge
    Chapter 10 Asymptotically Optimal Online Page Migration on Three Points
  12. Altmetric Badge
    Chapter 11 R–LINE: A Better Randomized 2-Server Algorithm on the Line
  13. Altmetric Badge
    Chapter 12 Black and White Bin Packing
  14. Altmetric Badge
    Chapter 13 Minimizing Cache Usage in Paging
  15. Altmetric Badge
    Chapter 14 Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems
  16. Altmetric Badge
    Chapter 15 Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
  17. Altmetric Badge
    Chapter 16 Approximating the Throughput by Coolest First Scheduling
  18. Altmetric Badge
    Chapter 17 Algorithms for Cost-Aware Scheduling
  19. Altmetric Badge
    Chapter 18 A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
  20. Altmetric Badge
    Chapter 19 Some Anomalies of Farsighted Strategic Behavior
  21. Altmetric Badge
    Chapter 20 Scheduling with an Orthogonal Resource Constraint
  22. Altmetric Badge
    Chapter 21 Improved Approximation Guarantees for Lower-Bounded Facility Location
  23. Altmetric Badge
    Chapter 22 A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs
  24. Altmetric Badge
    Chapter 23 Approximation Algorithms for the Wafer to Wafer Integration Problem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet

Readers on

mendeley
39 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.
Title
Approximation and Online Algorithms
Published by
Springer, Berlin, Heidelberg, January 2012
DOI 10.1007/978-3-642-38016-7
ISBNs
978-3-64-238015-0, 978-3-64-238016-7
Editors

Thomas Erlebach, Giuseppe Persiano

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Germany 2 5%
Portugal 1 3%
Australia 1 3%
Mexico 1 3%
United Kingdom 1 3%
Japan 1 3%
Unknown 32 82%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 14 36%
Researcher 5 13%
Professor > Associate Professor 4 10%
Student > Doctoral Student 4 10%
Student > Bachelor 3 8%
Other 9 23%
Readers by discipline Count As %
Computer Science 14 36%
Business, Management and Accounting 6 15%
Mathematics 6 15%
Engineering 5 13%
Unspecified 4 10%
Other 4 10%