The Parameterized Hardness of the k-Center Problem in Transportation Networks.
Andreas Emil FeldmannDániel MarxPublished in: Algorithmica (2020)
Keyphrases
- transportation networks
- traveling salesman problem
- travel time
- road network
- network design problem
- travel cost
- phase transition
- computational complexity
- np hard
- worst case
- information theoretic
- combinatorial optimization
- vehicle routing problem
- learning theory
- special case
- moving objects
- neural network
- shortest path
- np complete
- dynamic programming
- multi objective
- traffic conditions
- np hardness
- computer vision