NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors

Edward Gimadi, Alexey Baburin, Nikolai Glebov, Artem Pyatkin. NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. Electronic Notes in Discrete Mathematics, 27:29-31, 2006. [doi]

@article{GimadiBGP06,
  title = {NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors},
  author = {Edward Gimadi and Alexey Baburin and Nikolai Glebov and Artem Pyatkin},
  year = {2006},
  doi = {10.1016/j.endm.2006.08.041},
  url = {http://dx.doi.org/10.1016/j.endm.2006.08.041},
  researchr = {https://researchr.org/publication/GimadiBGP06},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Discrete Mathematics},
  volume = {27},
  pages = {29-31},
}