↓ 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 Online Coloring of Intervals with Bandwidth
  3. Altmetric Badge
    Chapter 2 Open Block Scheduling in Optical Communication Networks
  4. Altmetric Badge
    Chapter 3 Randomized Priority Algorithms
  5. Altmetric Badge
    Chapter 4 Tradeoffs in Worst-Case Equilibria
  6. Altmetric Badge
    Chapter 5 Load Balancing of Temporary Tasks in the ℓ p Norm
  7. Altmetric Badge
    Chapter 6 Simple On-Line Algorithms for Call Control in Cellular Networks
  8. Altmetric Badge
    Chapter 7 Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
  9. Altmetric Badge
    Chapter 8 A $\frac{5}{4}$ -Approximation Algorithm for Scheduling Identical Malleable Tasks
  10. Altmetric Badge
    Chapter 9 Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
  11. Altmetric Badge
    Chapter 10 Scheduling AND/OR-Networks on Identical Parallel Machines
  12. Altmetric Badge
    Chapter 11 Combinatorial Interpretations of Dual Fitting and Primal Fitting
  13. Altmetric Badge
    Chapter 12 On the Approximability of the Minimum Fundamental Cycle Basis Problem
  14. Altmetric Badge
    Chapter 13 The Pledge Algorithm Reconsidered under Errors in Sensors and Motion
  15. Altmetric Badge
    Chapter 14 The Online Matching Problem on a Line
  16. Altmetric Badge
    Chapter 15 How to Whack Moles
  17. Altmetric Badge
    Chapter 16 Online Deadline Scheduling: Team Adversary and Restart
  18. Altmetric Badge
    Chapter 17 Minimum Sum Multicoloring on the Edges of Trees
  19. Altmetric Badge
    Chapter 18 Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms
  20. Altmetric Badge
    Chapter 19 On-Line Extensible Bin Packing with Unequal Bin Sizes
  21. Altmetric Badge
    Chapter 20 Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms
  22. Altmetric Badge
    Chapter 21 Power Consumption Problems in Ad-Hoc Wireless Networks
  23. Altmetric Badge
    Chapter 22 A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem
  24. Altmetric Badge
    Chapter 23 Disk Graphs: A Short Survey
  25. Altmetric Badge
    Chapter 24 Combinatorial Techniques for Memory Power State Scheduling in Energy-Constrained Systems
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
10 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, February 2004
DOI 10.1007/b95598
ISBNs
978-3-54-021079-5, 978-3-54-024592-6
Editors

Solis-Oba, Roberto, Jansen, Klaus

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 10%
Unknown 9 90%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 20%
Researcher 2 20%
Student > Ph. D. Student 1 10%
Other 1 10%
Student > Doctoral Student 1 10%
Other 1 10%
Unknown 2 20%
Readers by discipline Count As %
Agricultural and Biological Sciences 5 50%
Unspecified 1 10%
Biochemistry, Genetics and Molecular Biology 1 10%
Physics and Astronomy 1 10%
Unknown 2 20%