Login / Signup
Polynomial-time approximability of the k-Sink Location problem.
Rémy Belmonte
Yuya Higashikawa
Naoki Katoh
Yoshio Okamoto
Published in:
CoRR (2015)
Keyphrases
</>
approximation algorithms
special case
np hard
database
real world
computational complexity
location information
single facility
real time
image sequences
multi agent
evolutionary algorithm
worst case