On Approximating the Maximum Simple Sharing Problem

Danny Z. Chen, Rudolf Fleischer, Jian Li, Zhiyi Xie, Hong Zhu. On Approximating the Maximum Simple Sharing Problem. In Tetsuo Asano, editor, Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings. Volume 4288 of Lecture Notes in Computer Science, pages 547-556, Springer, 2006. [doi]

@inproceedings{ChenFLXZ06,
  title = {On Approximating the Maximum Simple Sharing Problem},
  author = {Danny Z. Chen and Rudolf Fleischer and Jian Li and Zhiyi Xie and Hong Zhu},
  year = {2006},
  doi = {10.1007/11940128_55},
  url = {http://dx.doi.org/10.1007/11940128_55},
  researchr = {https://researchr.org/publication/ChenFLXZ06},
  cites = {0},
  citedby = {0},
  pages = {547-556},
  booktitle = {Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings},
  editor = {Tetsuo Asano},
  volume = {4288},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-49694-7},
}