{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:27:54Z","timestamp":1763458074539,"version":"3.45.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T00:00:00Z","timestamp":1510704000000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-0964474 and CCF-1016799"],"award-info":[{"award-number":["CCF-0964474 and CCF-1016799"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2017,1,31]]},"abstract":"<jats:p>\n                    We consider the hub label optimization problem, which arises in designing fast preprocessing-based shortest-path algorithms. We give\n                    <jats:italic toggle=\"yes\">O<\/jats:italic>\n                    (log\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    )-approximation algorithms for the objectives of minimizing the maximum label size (\u2113\n                    <jats:sub>\u221e<\/jats:sub>\n                    -norm) and simultaneously minimizing a constant number of \u2113\n                    <jats:sub>\n                      <jats:italic toggle=\"yes\">p<\/jats:italic>\n                    <\/jats:sub>\n                    -norms. Prior to this, an\n                    <jats:italic toggle=\"yes\">O<\/jats:italic>\n                    (log\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    )-approximation algorithm was known [Cohen et al. 2003] only for minimizing the total label size (\u2113\n                    <jats:sub>1<\/jats:sub>\n                    -norm).\n                  <\/jats:p>","DOI":"10.1145\/2996593","type":"journal-article","created":{"date-parts":[[2016,11,15]],"date-time":"2016-11-15T08:35:02Z","timestamp":1479198902000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for Hub Label Optimization"],"prefix":"10.1145","volume":"13","author":[{"given":"Maxim","family":"Babenko","sequence":"first","affiliation":[{"name":"National Research University Higher School of Economics, Kochnovskiy Proezd, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[{"name":"Amazon.com, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[{"name":"University of Michigan, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,11,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008623.2008645"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796265"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060639"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.02.003"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_22"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Daniel Delling Peter Sanders Dominik Schultes and Dorothea Wagner. 2009. Engineering route planning algorithms. In Algorithmics of Large and Complex Networks Dorothea Wagner J\u00fcrgen Lerner and Katharina Zweig (Eds.). 117--139. 10.1007\/978-3-642-02094-0_7","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/070698774"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1032"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1552285.1552289"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.68"},{"key":"e_1_2_1_19_1","volume-title":"HOPI: An efficient connection index for complex XML document collections. In Advances in Database Technology\u2014Proceedings of the 9th International Conference on Extending Database Technology (EDBT","author":"Schenkel Ralf","year":"2004","unstructured":"Ralf Schenkel, Anja Theobald, and Gerhard Weikum. 2004. HOPI: An efficient connection index for complex XML document collections. In Advances in Database Technology\u2014Proceedings of the 9th International Conference on Extending Database Technology (EDBT 2004). 237--255."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316548"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2996593","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2996593","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2996593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:16:08Z","timestamp":1763457368000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2996593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1,31]]}},"alternative-id":["10.1145\/2996593"],"URL":"https:\/\/doi.org\/10.1145\/2996593","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2016,11,15]]},"assertion":[{"value":"2015-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-09-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-11-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}