{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:09Z","timestamp":1781031429785,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/legalcode"}],"funder":[{"name":"SNF","award":["200021_200731"],"award-info":[{"award-number":["200021_200731"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800765","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"467-477","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Constant-Factor Approximation for Directed Latency"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5181-802X","authenticated-orcid":false,"given":"Jannis","family":"Blauth","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-6044","authenticated-orcid":false,"given":"Ramin","family":"Mousavi","sequence":"additional","affiliation":[{"name":"IDSIA, USI-SUPSI, Lugano, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1986200100791"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46521-9_1"},{"key":"e_1_3_2_1_3_1","unstructured":"Jannis Blauth and Ramin Mousavi. 2025. A Constant-Factor Approximation for Directed Latency. arXiv preprint arXiv:2512.15473."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195125"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/050645464"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229163.2229167"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290677"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Uriel Feige and Mohit Singh. 2007. Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. In Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques (APPROX). 104\u2013118. https:\/\/doi.org\/10.1007\/978-3-540-74208-1_8 10.1007\/978-3-540-74208-1_8","DOI":"10.1007\/978-3-540-74208-1_8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/100797357"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59250-3_17"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2021.12.001"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585867"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01450-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Elias Koutsoupias Christos Papadimitriou and Mihalis Yannakakis. 1996. Searching a fixed graph. In International Colloquium on Automata Languages and Programming (ICALP). 280\u2013289. https:\/\/doi.org\/10.1007\/3-540-61440-0_135 10.1007\/3-540-61440-0_135","DOI":"10.1007\/3-540-61440-0_135"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02097807"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Viswanath Nagarajan and R Ravi. 2008. The Directed Minimum Latency Problem. In Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques (APPROX). 193\u2013206. https:\/\/doi.org\/10.1007\/978-3-540-85363-3_16 10.1007\/978-3-540-85363-3_16","DOI":"10.1007\/978-3-540-85363-3_16"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9509-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.35"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M126918X"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3424306"},{"key":"e_1_3_2_1_22_1","unstructured":"Jens Vygen. 2026. Better approximation guarantee for Asymmetric TSP. arXiv preprint arXiv:2603.14334."}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:01:07Z","timestamp":1781028067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":22,"alternative-id":["10.1145\/3798129.3800765","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800765","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}