A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

Maurice Cheung, David B. Shmoys. A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. In Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. Volume 6845 of Lecture Notes in Computer Science, pages 135-146, Springer, 2011. [doi]

@inproceedings{CheungS11,
  title = {A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems},
  author = {Maurice Cheung and David B. Shmoys},
  year = {2011},
  doi = {10.1007/978-3-642-22935-0_12},
  url = {http://dx.doi.org/10.1007/978-3-642-22935-0_12},
  researchr = {https://researchr.org/publication/CheungS11},
  cites = {0},
  citedby = {0},
  pages = {135-146},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings},
  editor = {Leslie Ann Goldberg and Klaus Jansen and R. Ravi and José D. P. Rolim},
  volume = {6845},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-22934-3},
}