Algorithms for hub label optimization

Authors:
Maxim Babenko;Andrew V. Goldberg;Anupam Gupta;Viswanath Nagarajan
Affiliations:
Department of Mechanics and Mathematics, Moscow State Univerity, Yandex;Microsoft Research Silicon Valley;Carnegie Mellon University and Microsoft Research SVC;IBM T.J. Watson Research Center
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Year:
2013

Citing 15
Cited 1

A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Generating sparse 2-spanners

Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Undirected single-source shortest paths with positive integer weights in linear time

Journal of the ACM (JACM)
Load balancing in the L/sub p/ norm

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Reachability and Distance Queries via 2-Hop Labels

SIAM Journal on Computing
All-norm approximation algorithms

Journal of Algorithms
Distance labeling in graphs

Journal of Algorithms
Convex programming for scheduling unrelated parallel machines

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Practical Shortest Path Algorithm with Linear Expected Time

SIAM Journal on Computing
A unified approach to scheduling on unrelated parallel machines

Journal of the ACM (JACM)
Engineering Route Planning Algorithms

Algorithmics of Large and Complex Networks
A hub-based labeling algorithm for shortest paths in road networks

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Hierarchical hub labelings for shortest paths

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Shortest-path queries in static networks

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of approximating optimal hub labelings in the context of labeling algorithms for the shortest path problem. A previous result was a O(logn) approximating for minimizing the total label size. We give an O(logn)-approximation algorithm for the maximum label size. We also give O(logn)-approximation algorithms for natural generalizations of the problem: Minimizing an ℓp norm of the labeling and simultaneously minimizing ℓp and ℓq norms.