Finding Meeting Locations for Mapping Applications

Techniques for finding an optimal meeting location using distributed computing may include for finding a center node within a network given a set of source nodes. Methods include creating a priority queue for each source node, iteratively updating distances and/or sums of distances for unvisited nodes from the priority queue using a shortest path algorithm, alternating between the priority queues for each of the plurality of source nodes, and updating a minimax value each time a smaller maximum distance is found. The method also includes terminating the shortest path algorithm once a stopping condition is met (e.g., a maximum distance for an extracted node is found to be larger than a current minimax value). When all source nodes have been terminated, a center node may be determined and sent to the source nodes. The center node may represent a meeting location.