↓ 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 Locating Service and Charging Stations
  3. Altmetric Badge
    Chapter 2 Graph Burning and Non-uniform k -centers for Small Treewidth
  4. Altmetric Badge
    Chapter 3 Scheduling with Machine Conflicts
  5. Altmetric Badge
    Chapter 4 Knapsack Secretary Through Boosting
  6. Altmetric Badge
    Chapter 5 Scheduling Appointments Online: The Power of Deferred Decision-Making
  7. Altmetric Badge
    Chapter 6 Canadian Traveller Problem with Predictions
  8. Altmetric Badge
    Chapter 7 The Power of Amortized Recourse for Online Graph Problems
  9. Altmetric Badge
    Chapter 8 An Improved Algorithm for Open Online Dial-a-Ride
  10. Altmetric Badge
    Chapter 9 Stochastic Graph Exploration with Limited Resources
  11. Altmetric Badge
    Chapter 10 Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem
  12. Altmetric Badge
    Chapter 11 On Streaming Algorithms for Geometric Independent Set and Clique
  13. Altmetric Badge
    Chapter 12 Approximating Length-Restricted Means Under Dynamic Time Warping
Attention for Chapter 3: Scheduling with Machine Conflicts
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
Scheduling with Machine Conflicts
Chapter number 3
Book title
Approximation and Online Algorithms
Published by
Springer, Cham, January 2022
DOI 10.1007/978-3-031-18367-6_3
Book ISBNs
978-3-03-118366-9, 978-3-03-118367-6
Authors

Buchem, Moritz, Kleist, Linda, Schmidt genannt Waldschmidt, Daniel

View on publisher site
Timeline

Login to access the full chart related to this output.

If you don’t have an account, click here to discover Explorer

This page is provided by Altmetric.