Poly-APX- and PTAS-Completeness in Standard and Differential Approximation

Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos. Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. In Rudolf Fleischer, Gerhard Trippen, editors, Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings. Volume 3341 of Lecture Notes in Computer Science, pages 124-136, Springer, 2004. [doi]

@inproceedings{BazganEP04,
  title = {Poly-APX- and PTAS-Completeness in Standard and Differential Approximation},
  author = {Cristina Bazgan and Bruno Escoffier and Vangelis Th. Paschos},
  year = {2004},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3341&spage=124},
  tags = {completeness},
  researchr = {https://researchr.org/publication/BazganEP04},
  cites = {0},
  citedby = {0},
  pages = {124-136},
  booktitle = {Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings},
  editor = {Rudolf Fleischer and Gerhard Trippen},
  volume = {3341},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-24131-0},
}