↓ 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 Terrain-Like Graphs: PTASs for Guarding Weakly-Visible Polygons and Terrains
  3. Altmetric Badge
    Chapter 2 A New Lower Bound for Classic Online Bin Packing
  4. Altmetric Badge
    Chapter 3 Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-( s ,  t )-Cuts
  5. Altmetric Badge
    Chapter 4 Robust Online Algorithms for Certain Dynamic Packing Problems
  6. Altmetric Badge
    Chapter 5 Approximation Results for Makespan Minimization with Budgeted Uncertainty
  7. Altmetric Badge
    Chapter 6 Streaming Algorithms for Bin Packing and Vector Scheduling
  8. Altmetric Badge
    Chapter 7 An Improved Upper Bound for the Ring Loading Problem
  9. Altmetric Badge
    Chapter 8 Parallel Online Algorithms for the Bin Packing Problem
  10. Altmetric Badge
    Chapter 9 Managing Multiple Mobile Resources
  11. Altmetric Badge
    Chapter 10 On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
  12. Altmetric Badge
    Chapter 11 Approximate Strong Edge-Colouring of Unit Disk Graphs
  13. Altmetric Badge
    Chapter 12 Precedence-Constrained Scheduling and Min-Sum Set Cover
  14. Altmetric Badge
    Chapter 13 Fault Tolerant Clustering with Outliers
  15. Altmetric Badge
    Chapter 14 Improved (In-)Approximability Bounds for d -Scattered Set
  16. Altmetric Badge
    Chapter 15 Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
  17. Altmetric Badge
    Chapter 16 Fair Coresets and Streaming Algorithms for Fair k -means
Attention for Chapter 15: Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
Altmetric Badge
Summary
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
Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
Chapter number 15
Book title
Approximation and Online Algorithms
Published by
Springer, Cham, September 2019
DOI 10.1007/978-3-030-39479-0_15
Book ISBNs
978-3-03-039478-3, 978-3-03-039479-0
Authors

Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong, Liu, Fu-Hong, Liu, Hsiang-Hsuan, Wong, Prudence W. H.

View on publisher site

This page is provided by Altmetric.