Hub Label Compression

@inproceedings{Delling2013HubLC,
  title={Hub Label Compression},
  author={Daniel Delling and Andrew V. Goldberg and Renato F. Werneck},
  booktitle={SEA},
  year={2013}
}
The hub labels (HL) algorithm is the fastest known technique for computing driving times on road networks, but its practical applicability can be limited by high space requirements relative to the best competing methods. We develop compression techniques that substantially reduce HL space requirements with a small performance penalty. 
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
18 Extracted Citations
20 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 18 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 20 references

The Shortest Path Problem: 9th DIMACS Implementation Challenge

  • C. Demetrescu, A. V. Goldberg, D. S. Johnson, editors
  • DIMACS Book 74
  • 2009
Highly Influential
3 Excerpts

Location - Based Services in Databases

  • D. Delling I. Abraham, A. Fiat, A. V. Goldberg, R. F. Werneck
  • Proc . SIGSPATIAL GIS
  • 2012

Similar Papers

Loading similar papers…