{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:21Z","timestamp":1740109281039,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T00:00:00Z","timestamp":1534118400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T00:00:00Z","timestamp":1534118400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1618866"],"award-info":[{"award-number":["CCF-1618866"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00453-018-0491-9","type":"journal-article","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T14:13:45Z","timestamp":1534169625000},"page":"4098-4117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modular Circulation and Applications to Traffic Management"],"prefix":"10.1007","volume":"81","author":[{"given":"Philip","family":"Dasler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"key":"491_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)"},{"key":"491_CR2","unstructured":"Boeing, G.: Planarity and street network representation in urban form analysis (2018). arXiv:1806.01805"},{"key":"491_CR3","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, vol. 2, 2nd edn. McGraw-Hill Higher Education, Boston (2001)"},{"key":"491_CR4","doi-asserted-by":"crossref","unstructured":"Dasler, P., Mount, D.\u00a0M.: On the complexity of an unregulated traffic crossing. In: Proceedings of 14th International Symposium Algorithms Data Structure, volume 9214 of Lecture Notes Computer Science, pp. 224\u2013235. Springer (2015)","DOI":"10.1007\/978-3-319-21840-3_19"},{"key":"491_CR5","first-page":"591","volume":"31","author":"KM Dresner","year":"2008","unstructured":"Dresner, K.M., Stone, P.: A multiagent approach to autonomous intersection management. J. Artif. Int. Res. 31, 591\u2013656 (2008)","journal-title":"J. Artif. Int. Res."},{"key":"491_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5, 88\u2013124 (1973)","journal-title":"Math. Program."},{"key":"491_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"491_CR8","unstructured":"Eppstein, D., Gupta, S.: Crossing patterns in nonplanar road networks (2017). arXiv:1709.06113"},{"key":"491_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"491_CR10","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"AV Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM 36, 873\u2013886 (1989)","journal-title":"J. ACM"},{"key":"491_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.trc.2014.05.008","volume":"46","author":"SI Guler","year":"2014","unstructured":"Guler, S.I., Menendez, M., Meier, L.: Using connected vehicle technology to improve the efficiency of intersections. Transp. Res. Part C Emerg. Technol. 46, 121\u2013131 (2014)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"491_CR12","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley, Boston (2005)"},{"key":"491_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11, 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"491_CR14","first-page":"109","volume":"78","author":"JB Orlin","year":"1997","unstructured":"Orlin, J.B.: A polynomial time primal network simplex algorithm for minimum cost flows. Math. Program. 78, 109\u2013129 (1997)","journal-title":"Math. Program."},{"issue":"3","key":"491_CR15","doi-asserted-by":"publisher","first-page":"e0149607","DOI":"10.1371\/journal.pone.0149607","volume":"11","author":"R Tachet","year":"2016","unstructured":"Tachet, R., Santi, P., Sobolevsky, S., Reyes-Castro, L.I., Frazzoli, E., Helbing, D., Ratti, C.: Revisiting street intersections using slot-based systems. PLoS One 11(3), e0149607 (2016)","journal-title":"PLoS One"},{"key":"491_CR16","unstructured":"Vial, J.\u00a0J.\u00a0B., Devanny, W.\u00a0E., Eppstein, D., Goodrich, M.\u00a0T.: Scheduling autonomous vehicle platoons through an unregulated intersection. In: Goerigk, M., & Werneck, R. (eds.) 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016), vol. 54 of OpenAccess Series in Informatics (OASIcs), pp. 1\u201314. Schloss DagstuhlLeibniz-Zentrum fuer Informatik (2016)"},{"key":"491_CR17","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.\u00a0M.: Multi-agent path planning and network flow. In: Frazzoli, E., Lozano-Perez, T., Roy, N., & Rus, D. (eds.) Algorithmic Foundations of Robotics X: Proceedings of the Tenth Workshop on the Algorithmic Foundations of Robotics, pp. 157\u2013173, Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36279-8_10"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0491-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0491-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0491-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T04:25:49Z","timestamp":1661747149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0491-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,13]]},"references-count":17,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["491"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0491-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,8,13]]},"assertion":[{"value":"13 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}