Login / Signup
The Parameterized Hardness of the k-Center Problem in Transportation Networks.
Andreas Emil Feldmann
Dániel Marx
Published in:
CoRR (2018)
Keyphrases
</>
transportation networks
traveling salesman problem
travel time
road network
network design problem
computational complexity
phase transition
travel cost
constraint satisfaction
neural network
genetic algorithm
learning algorithm
np hard
np complete
traffic flow
np hardness