Login / Signup
The Parameterized Hardness of the k-Center Problem in Transportation Networks.
Andreas Emil Feldmann
Dániel Marx
Published in:
SWAT (2018)
Keyphrases
</>
transportation networks
road network
traveling salesman problem
travel time
network design problem
phase transition
computational complexity
worst case
travel cost
computer vision
np complete
genetic algorithm
search algorithm
multi objective
learning theory
traffic conditions