{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:54:42Z","timestamp":1725738882063},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392054"},{"type":"electronic","value":"9783642392061"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39206-1_7","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T17:20:16Z","timestamp":1372785616000},"page":"69-80","source":"Crossref","is-referenced-by-count":12,"title":["Algorithms for Hub Label Optimization"],"prefix":"10.1007","author":[{"given":"Maxim","family":"Babenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I. Abraham","year":"2011","unstructured":"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.\u00a06630, pp. 230\u2013241. Springer, Heidelberg (2011)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012","author":"I. Abraham","year":"2012","unstructured":"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.\u00a07501, pp. 24\u201335. Springer, Heidelberg (2012)"},{"issue":"5","key":"7_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/1552285.1552289","volume":"56","author":"V.S.A. Kumar","year":"2009","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: A unified approach to scheduling on unrelated parallel machines. JACM\u00a056(5), 28\u201331 (2009)","journal-title":"JACM"},{"issue":"3","key":"7_CR4","first-page":"486","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"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.\u00a0ACM\u00a044(3), 486\u2013504 (1997)","journal-title":"J.\u00a0ACM"},{"key":"7_CR5","unstructured":"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\u2013391 (1995)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: STOC 2005, pp. 331\u2013337 (2005)","DOI":"10.1145\/1060590.1060639"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.jalgor.2004.02.003","volume":"52","author":"Y. Azar","year":"2004","unstructured":"Azar, Y., Epstein, L., Richter, Y., Woeginger, G.J.: All-norm approximation algorithms. J. Algorithms\u00a052(2), 120\u2013133 (2004)","journal-title":"J. Algorithms"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. SIAM J. Comput. 32 (2003)","DOI":"10.1137\/S0097539702403098"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"issue":"4","key":"7_CR11","first-page":"634","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J.\u00a0ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J.\u00a0ACM"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A Fast Parametric Maximum Flow Algorithm and Applications. SIAM J. Comput.\u00a018, 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C. Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance Labeling in Graphs. Journal of Algorithms\u00a053, 85\u2013112 (2004)","journal-title":"Journal of Algorithms"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/070698774","volume":"37","author":"A.V. Goldberg","year":"2008","unstructured":"Goldberg, A.V.: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM Journal on Computing\u00a037, 1637\u20131655 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G. Kortsarz","year":"1994","unstructured":"Kortsarz, G., Peleg, D.: Generating Sparse 2-Spanners. J.Alg.\u00a017, 222\u2013236 (1994)","journal-title":"J.Alg."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/316542.316548","volume":"46","author":"M. Thorup","year":"1999","unstructured":"Thorup, M.: Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. JACM\u00a046, 362\u2013394 (1999)","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39206-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:42:42Z","timestamp":1558316562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39206-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392054","9783642392061"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39206-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}