Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems

David B. Shmoys. Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems. In Klaus Jansen, Dorit S. Hochbaum, editors, Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX 98, Aalborg, Denmark, July 18-19, 1998, Proceedings. Volume 1444 of Lecture Notes in Computer Science, pages 15-32, Springer, 1998. [doi]

@inproceedings{Shmoys98,
  title = {Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems},
  author = {David B. Shmoys},
  year = {1998},
  url = {http://link.springer.de/link/service/series/0558/bibs/1444/14440015.htm},
  tags = {program analysis, analysis, programming, design},
  researchr = {https://researchr.org/publication/Shmoys98},
  cites = {0},
  citedby = {0},
  pages = {15-32},
  booktitle = {Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX 98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
  editor = {Klaus Jansen and Dorit S. Hochbaum},
  volume = {1444},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-64736-8},
}