↓ Skip to main content
What is this page? Embed badge

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 Packet Switching
  3. Altmetric Badge
    Chapter 2 Approximation Algorithms for Mixed Fractional Packing and Covering Problems
  4. Altmetric Badge
    Chapter 3 Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k -Trees
  5. Altmetric Badge
    Chapter 4 Online Bin Packing with Resource Augmentation
  6. Altmetric Badge
    Chapter 5 A PTAS for Delay Minimization in Establishing Wireless Conference Calls
  7. Altmetric Badge
    Chapter 6 This Side Up!
  8. Altmetric Badge
    Chapter 7 Approximation Algorithm for Directed Multicuts
  9. Altmetric Badge
    Chapter 8 Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
  10. Altmetric Badge
    Chapter 9 Approximation Algorithms for Spreading Points
  11. Altmetric Badge
    Chapter 10 More Powerful and Simpler Cost-Sharing Methods
  12. Altmetric Badge
    Chapter 11 Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints
  13. Altmetric Badge
    Chapter 12 Priority Algorithms for Graph Optimization Problems
  14. Altmetric Badge
    Chapter 13 Pricing Network Edges to Cross a River
  15. Altmetric Badge
    Chapter 14 Submodular Integer Cover and Its Application to Production Planning
  16. Altmetric Badge
    Chapter 15 Stochastic Online Scheduling on Parallel Machines
  17. Altmetric Badge
    Chapter 16 A $\frac{5}{4}$ -Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path
  18. Altmetric Badge
    Chapter 17 Order-Preserving Transformations and Greedy-Like Algorithms
  19. Altmetric Badge
    Chapter 18 Off-line Admission Control for Advance Reservations in Star Networks
  20. Altmetric Badge
    Chapter 19 Joint Base Station Scheduling
  21. Altmetric Badge
    Chapter 20 Universal Bufferless Routing
  22. Altmetric Badge
    Chapter 21 Strong Colorings of Hypergraphs
  23. Altmetric Badge
    Chapter 22 Deterministic Monotone Algorithms for Scheduling on Related Machines
  24. Altmetric Badge
    Chapter 23 Better Bounds for Minimizing SONET ADMs
Attention for Chapter 22: Deterministic Monotone Algorithms for Scheduling on Related Machines
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
1 Mendeley
Summary Wikipedia
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
Deterministic Monotone Algorithms for Scheduling on Related Machines
Chapter number 22
Book title
Approximation and Online Algorithms
Published by
Springer, Berlin, Heidelberg, September 2004
DOI 10.1007/978-3-540-31833-0_22
Book ISBNs
978-3-54-024574-2, 978-3-54-031833-0
Authors

Pasquale Ambrosio, Vincenzo Auletta, Ambrosio, Pasquale, Auletta, Vincenzo

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Mathematics 1 100%

This page is provided by Altmetric.