Login / Signup
NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors.
Edward Gimadi
Alexey Baburin
Alexei N. Glebov
Artem V. Pyatkin
Published in:
Electron. Notes Discret. Math. (2006)
Keyphrases
</>
total weight
np hardness
approximation algorithms
np hard
vertex cover
special case
minimum cost
worst case
constant factor
approximation ratio
primal dual
euclidean distance
vector space
euclidean space
combinatorial optimization
social networks
lower bound
computational complexity