Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems

Viggo Kann, Jens Lagergren, Alessandro Panconesi. Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. Inf. Process. Lett., 58(3):105-110, 1996. [doi]

@article{KannLP96,
  title = {Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems},
  author = {Viggo Kann and Jens Lagergren and Alessandro Panconesi},
  year = {1996},
  doi = {10.1016/0020-0190(96)00046-4},
  url = {http://dx.doi.org/10.1016/0020-0190(96)00046-4},
  tags = {completeness},
  researchr = {https://researchr.org/publication/KannLP96},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {58},
  number = {3},
  pages = {105-110},
}