k-center in a large graph (road-network)
I'm currently looking for a way to solve the k-center problem on a large,
sparse graph. The data comes from openstreetmap and I want to place k
pizza-delivery-branches in the city in such way as the distance to any
node in the graph from a branch in minimized.
The graph contains approximately 50,000 to 250,000 nodes.
I can't wait to hear from your ideas how to solve the problem on such a
large real-word-graph (road-network).
No comments:
Post a Comment