Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions

Khaled M. Elbassioni, Trung Thanh Nguyen 0004. Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions. Discrete Applied Mathematics, 230:56-70, 2017. [doi]

@article{ElbassioniN17-0,
  title = {Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions},
  author = {Khaled M. Elbassioni and Trung Thanh Nguyen 0004},
  year = {2017},
  doi = {10.1016/j.dam.2017.06.020},
  url = {https://doi.org/10.1016/j.dam.2017.06.020},
  researchr = {https://researchr.org/publication/ElbassioniN17-0},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {230},
  pages = {56-70},
}