Skip to main content
SpringerLink
Log in

Hub Labeling (2-Hop Labeling)

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Abraham I, Fiat A, Goldberg AV, Werneck RF (2010) Highway dimension, shortest paths, and provably efficient algorithms. In: Proceedings of 21st ACM-SIAM symposium on discrete algorithms, Austin, pp 782–793

    Google Scholar 

  2. Abraham I, Delling D, Goldberg AV, Werneck RF (2011) A hub-based labeling algorithm for shortest paths on road networks. In: Proceedings of the 10th international symposium on experimental algorithms (SEA’11), Chania. Volume 6630 of Lecture notes in computer science. Springer, pp 230–241

    Google Scholar 

  3. Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF (2012) HLDB: location-based services in databases. In: Proceedings of the 20th ACM SIGSPATIAL international symposium on advances in geographic information systems (GIS’12), Redondo Beach. ACM, pp 339–348

    Google Scholar 

  4. Abraham I, Delling D, Goldberg AV, Werneck RF (2012) Hierarchical hub labelings for shortest paths. In: Proceedings of the 20th annual European symposium on algorithms (ESA’12), Ljubljana. Volume 7501 of Lecture notes in computer science. Springer, pp 24–35

    Google Scholar 

  5. Akiba T, Iwata Y, Yoshida Y (2013) Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, SIGMOD’13, New York. ACM, pp 349–360

    Chapter  Google Scholar 

  6. Babenko M, Goldberg AV, Gupta A, Nagarajan V (2013) Algorithms for hub label optimization. In: Fomin FV, Freivalds R, Kwiatkowska M, Peleg D (eds) Proceedings of 30th ICALP, Riga. Lecture notes in computer science, vol 7965. Springer, pp 69–80

    Google Scholar 

  7. Bast H, Delling D, Goldberg AV, Müller–Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2014) Route planning in transportation networks. Technical report MSR-TR-2014-4, Microsoft research

    Google Scholar 

  8. Chvátal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3): 233–235

    Article  MathSciNet  MATH  Google Scholar 

  9. Cohen E, Halperin E, Kaplan H, Zwick U (2003) Reachability and distance queries via 2-hop labels. SIAM J Comput 32:1338–1355

    Article  MathSciNet  MATH  Google Scholar 

  10. Delling D, Goldberg AV, Werneck RF (2013) Hub label compression. In: Proceedings of the 12th international symposium on experimental algorithms (SEA’13), Rome. Volume 7933 of Lecture notes in computer science. Springer, pp 18–29

    Google Scholar 

  11. Delling D, Goldberg AV, Savchenko R, Werneck RF (2014) Hub labels: theory and practice. In: Proceedings of the 13th international symposium on experimental algorithms (SEA’14), Copenhagen. Lecture notes in computer science. Springer

    Google Scholar 

  12. Delling D, Goldberg AV, Pajor T, Werneck RF (2014, to appear) Robust distance queries on massive networks. In: Proceedings of the 22nd annual European symposium on algorithms (ESA’14), Wroclaw. Lecture notes in computer science. Springer

    Google Scholar 

  13. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1: 269–271

    Article  MathSciNet  MATH  Google Scholar 

  14. Gallo G, Grigoriadis MD, Tarjan RE (1989) A fast parametric maximum flow algorithm and applications. SIAM J Comput 18:30–55

    Article  MathSciNet  MATH  Google Scholar 

  15. Gavoille C, Peleg D, Pérennes S, Raz R (2004) Distance labeling in graphs. J Algorithms 53(1): 85–112

    Article  MathSciNet  MATH  Google Scholar 

  16. Geisberger R, Sanders P, Schultes D, Vetter C (2012) Exact routing in large road networks using contraction hierarchies. Transp Sci 46(3):388–404

    Article  Google Scholar 

  17. Kortsarz G, Peleg D (1994) Generating sparse 2-spanners. J Algorithms 17:222–236

    Article  MathSciNet  MATH  Google Scholar 

  18. Peleg D (2000) Proximity-preserving labeling schemes. J Graph Theory 33(3):167–176

    Article  MathSciNet  MATH  Google Scholar 

  19. Sanders P, Transier F (2007) Intersection in integer inverted indices. SIAM, Philadelphia, pp 71–83

    Google Scholar 

  20. Schenkel R, Theobald A, Weikum G (2004) HOPI: an efficient connection index for complex XML document collections. In: Advances in database technology – EDBT 2004. Springer, Berlin/Heidelberg, pp 237–255

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft, Silicon Valley, CA, USA

    Daniel Delling

  2. Microsoft Research – Silicon Valley, Mountain View, CA, USA

    Andrew V. Goldberg

  3. Microsoft Research Silicon Valley, La Avenida, CA, USA

    Renato F. Werneck

Authors
  1. Daniel Delling
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew V. Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Renato F. Werneck
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniel Delling .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Delling, D., Goldberg, A.V., Werneck, R.F. (2016). Hub Labeling (2-Hop Labeling). In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_580

Download citation

Publish with us

Policies and ethics

Search

Navigation