↓ 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
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
twitter
5 X users

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 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 International Publishing, April 2015
DOI 10.1007/978-3-319-18263-6
ISBNs
978-3-31-918262-9, 978-3-31-918263-6
Editors

Bampis, Evripidis, Svensson, Ola

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.