Article

Algorithms for hub label optimization

Authors:

Andrew V. Goldberg,

Viswanath NagarajanAuthors Info & Claims

ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Pages 69 - 80

https://doi.org/10.1007/978-3-642-39206-1_7

Published: 08 July 2013 Publication History

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.

References

[1]

Abraham, I., Delling, D., Goldberg, A. V., Werneck, R. F.: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In: Pardalos, P. M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230-241. Springer, Heidelberg (2011)

[2]

Abraham, I., Delling, D., Goldberg, A. V., Werneck, R. F.: Hierarchical Hub Labelings for Shortest Paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24-35. Springer, Heidelberg (2012)

[3]

Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., Srinivasan, A.: A unified approach to scheduling on unrelated parallel machines. JACM 56(5), 28-31 (2009)

[4]

Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486-504 (1997)

[5]

Awerbuch, B., Azar, Y., Grove, E. F., Kao, M.-Y., Krishnan, P., Vitter, J. S.: Load balancing in the lp norm. In: FOCS, pp. 383-391 (1995)

[6]

Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: STOC 2005, pp. 331-337 (2005)

[7]

Azar, Y., Epstein, L., Richter, Y., Woeginger, G. J.: All-norm approximation algorithms. J. Algorithms 52(2), 120-133 (2004)

[8]

Chvátal, V.: A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research 4(3), 233-235 (1979)

[9]

Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. SIAM J. Comput. 32 (2003)

[10]

Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K. A. (eds.) Algorithmics. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009)

[11]

Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634-652 (1998)

[12]

Gallo, G., Grigoriadis, M. D., Tarjan, R. E.: A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput. 18, 30-55 (1989)

[13]

Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance Labeling in Graphs. Journal of Algorithms 53, 85-112 (2004)

[14]

Goldberg, A. V.: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM Journal on Computing 37, 1637-1655 (2008)

[15]

Kortsarz, G., Peleg, D.: Generating Sparse 2-Spanners. J. Alg. 17, 222-236 (1994)

[16]

Thorup, M.: Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. JACM 46, 362-394 (1999)

Cited By

Kosowski AViennot LKlein P(2017)Beyond highway dimensionProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039781(1462-1478)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039781
Angelidakis HMakarychev YOparin VKlein P(2017)Algorithmic and hardness results for the hub labeling problemProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039780(1442-1461)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039780
Abraham IDelling DFiat AGoldberg AWerneck R(2016)Highway Dimension and Provably Efficient Shortest Path AlgorithmsJournal of the ACM10.1145/298547363:5(1-26)Online publication date: 8-Dec-2016
https://dl.acm.org/doi/10.1145/2985473
Show More Cited By

Algorithms for hub label optimization
1. Mathematics of computing
  1. Mathematical analysis
    1. Functional analysis
2. Theory of computation

Recommendations

Algorithms for Hub Label Optimization

We consider the hub label optimization problem, which arises in designing fast preprocessing-based shortest-path algorithms. We give O(log n)-approximation algorithms for the objectives of minimizing the maximum label size (ℓ_∞-norm) and simultaneously ...
Semi-supervised Multi-label k-Nearest Neighbors Classification Algorithms
BRACIS '15: Proceedings of the 2015 Brazilian Conference on Intelligent Systems (BRACIS)

Classification is one of the most traditional tasks in machine learning. In supervised learning for classification, the goal is to learn a classifier function using a completely labeled dataset. Semi-supervised learning modifies the learning algorithm ...
Transductive Multilabel Learning via Label Set Propagation

The problem of multilabel classification has attracted great interest in the last decade, where each instance can be assigned with a set of multiple class labels simultaneously. It has a wide variety of real-world applications, e.g., automatic image ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

July 2013

850 pages

ISBN:9783642392054

Editors:
Fedor V. Fomin
Department of Informatics, University of Bergen, Bergen, Norway
,
Rūsiņš Freivalds
Faculty of Computing, University of Latvia, Raina bulv. 19, Riga, Latvia
,
Marta Kwiatkowska
Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford, UK
,
David Peleg
Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Wolfson Building, Parks Road, Rehovot, Israel

Sponsors

QuBalt: QuBalt
University of Latvia: University of Latvia

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 08 July 2013

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kosowski AViennot LKlein P(2017)Beyond highway dimensionProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039781(1462-1478)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039781
Angelidakis HMakarychev YOparin VKlein P(2017)Algorithmic and hardness results for the hub labeling problemProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039780(1442-1461)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039780
Abraham IDelling DFiat AGoldberg AWerneck R(2016)Highway Dimension and Provably Efficient Shortest Path AlgorithmsJournal of the ACM10.1145/298547363:5(1-26)Online publication date: 8-Dec-2016
https://dl.acm.org/doi/10.1145/2985473
Krishnaswamy RNagarajan VPruhs KStein CShmoys D(2014)Cluster before you hallucinateProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591831(734-743)Online publication date: 31-May-2014
https://dl.acm.org/doi/10.1145/2591796.2591831
Sommer C(2014)Shortest-path queries in static networksACM Computing Surveys10.1145/253053146:4(1-31)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1145/2530531
Delling DGoldberg ASavchenko RWerneck R(2014)Hub LabelsProceedings of the 13th International Symposium on Experimental Algorithms - Volume 850410.1007/978-3-319-07959-2_22(259-270)Online publication date: 29-Jun-2014
https://dl.acm.org/doi/10.1007/978-3-319-07959-2_22

View Options

View options

Media

Figures

Other

Tables

View Table of Contents