Polynominal time approximation schemes for class-constrained packing problem

Hadas Shachnai, Tami Tamir. Polynominal time approximation schemes for class-constrained packing problem. In Klaus Jansen, Samir Khuller, editors, Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Volume 1913 of Lecture Notes in Computer Science, pages 238-249, Springer, 2000. [doi]

@inproceedings{ShachnaiT00,
  title = {Polynominal time approximation schemes for class-constrained packing problem},
  author = {Hadas Shachnai and Tami Tamir},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1913/19130238.htm},
  researchr = {https://researchr.org/publication/ShachnaiT00},
  cites = {0},
  citedby = {0},
  pages = {238-249},
  booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings},
  editor = {Klaus Jansen and Samir Khuller},
  volume = {1913},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-67996-0},
}