{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:32:07Z","timestamp":1738215127449,"version":"3.34.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,3,22]],"date-time":"2008-03-22T00:00:00Z","timestamp":1206144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00453-008-9179-x","type":"journal-article","created":{"date-parts":[[2008,3,21]],"date-time":"2008-03-21T14:39:36Z","timestamp":1206110376000},"page":"437-447","source":"Crossref","is-referenced-by-count":5,"title":["An Algorithm for Minimum Cost Arc-Connectivity Orientations"],"prefix":"10.1007","volume":"56","author":[{"given":"Satoru","family":"Iwata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,22]]},"reference":[{"key":"9179_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbol. Comput. 9, 251\u2013280 (1990)","journal-title":"J. Symbol. Comput."},{"key":"9179_CR2","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J.: Edge-disjoint branchings. In: Rustin, R. (ed.) Combinatorial Algorithms, pp. 91\u201396. Algorithmics Press, New York (1973)"},{"key":"9179_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185\u2013204 (1977)","journal-title":"Ann. Discrete Math."},{"key":"9179_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02579270","volume":"1","author":"A. Frank","year":"1981","unstructured":"Frank, A.: How to make a digraph strongly connected. Combinatorica 1, 145\u2013153 (1981)","journal-title":"Combinatorica"},{"key":"9179_CR5","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math. 16, 97\u2013120 (1982)","journal-title":"Ann. Discrete Math."},{"key":"9179_CR6","unstructured":"Fujishige, S., Tomizawa, N.: An algorithm for finding a minimum-cost strongly connected reorientation of a directed graph. Manuscript (1982)"},{"key":"9179_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: A framework for cost-scaling algorithms for submodular flow problems. In: Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pp. 449\u2013458 (1993)","DOI":"10.1109\/SFCS.1993.366842"},{"key":"9179_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1006\/jcss.1995.1022","volume":"50","author":"H.N. Gabow","year":"1995","unstructured":"Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50, 259\u2013273 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"9179_CR9","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1006\/jagm.1995.1022","volume":"18","author":"H.N. Gabow","year":"1995","unstructured":"Gabow, H.N.: Centroids, representations, and submodular flows. J. Algorithms 18, 586\u2013628 (1995)","journal-title":"J. Algorithms"},{"key":"9179_CR10","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","volume":"21","author":"L. Lov\u00e1sz","year":"1976","unstructured":"Lov\u00e1sz, L.: On two minimax theorems in graph. J. Comb. Theory B 21, 96\u2013103 (1976)","journal-title":"J. Comb. Theory B"},{"issue":"2","key":"9179_CR11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C.L. Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. Lond. Math. Soc. 17(2), 369\u2013374 (1978)","journal-title":"J. Lond. Math. Soc."},{"key":"9179_CR12","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","volume":"12","author":"C.St.J.A. Nash-Williams","year":"1960","unstructured":"Nash-Williams, C.St.J.A.: On orientations, connectivity and odd-vertex-pairings in finite graphs. Can. J. Math. 12, 555\u2013567 (1960)","journal-title":"Can. J. Math."},{"key":"9179_CR13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-387-25592-3_8","volume-title":"Graph Theory and Combinatorial Optimization","author":"F.B. Shepherd","year":"2005","unstructured":"Shepherd, F.B., Vetta, A.: Visualizing, finding, and packing dijoins. In: Avis, D., Hertz, A., Marcotte, O. (eds.) Graph Theory and Combinatorial Optimization, pp. 219\u2013254. Springer, Berlin (2005)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9179-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9179-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9179-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T05:47:11Z","timestamp":1738129631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9179-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,22]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9179"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9179-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2008,3,22]]}}}