• Published 2014

Two competitive ratio approximation schemes for a classical scheduling problem

@inproceedings{Coester2014TwoCR,
  title={Two competitive ratio approximation schemes for a classical scheduling problem},
  author={Christian Coester and Matt McCutchen},
  year={2014}
}
For a long time, optimal competitive factors of online algorithms used to be approximated by manually finding and improving upper and lower bounds. The concept of a competitive ratio approximation scheme (CRAS), introduced by Günther et al. in 2012 [13], defines a method of reducing this process to a task that can be executed automatically by a computer up to an arbitrarily good precision: A CRAS for an online problem is an algorithm that, for any ε > 0, computes the optimal competitive ratio… CONTINUE READING