{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:34Z","timestamp":1773656074658,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_52","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"576-587","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Transversals in Posi-modular Systems"],"prefix":"10.1007","author":[{"given":"Mariko","family":"Sakashita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoru","family":"Fujishige","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/jagm.2001.1203","volume":"42","author":"K. Arata","year":"2002","unstructured":"Arata, K., Iwata, S., Makino, K., Fujishige, S.: Locating sources to meet flow demands in undirected networks. J. Algorithms\u00a042, 54\u201368 (2002)","journal-title":"J. Algorithms"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.orl.2004.07.005","volume":"33","author":"M. B\u00e1r\u00e1sz","year":"2005","unstructured":"B\u00e1r\u00e1sz, M., Becker, J., Frank, A.: An algorithm for source location in directed graphs. Operations Research Letters\u00a033, 221\u2013230 (2005)","journal-title":"Operations Research Letters"},{"key":"52_CR3","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J. Hao","year":"1994","unstructured":"Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a graph. J. Algorithms\u00a017, 424\u2013446 (1994)","journal-title":"J. Algorithms"},{"key":"52_CR5","unstructured":"van den Heuvel, J., Johnson, M.: Transversals of subtree hypergraphs and the source location problem in digraphs, CDAM Research Report, LSE-CDAM-2004-10, London School of Economics"},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11527954_11","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"J. Heuvel van den","year":"2005","unstructured":"van den Heuvel, J., Johnson, M.: The external network problem with edge- or arc-connectivity requirements. In: L\u00f3pez-Ortiz, A., Hamel, A.M. (eds.) CAAN 2004. LNCS, vol.\u00a03405, pp. 114\u2013126. Springer, Heidelberg (2005)"},{"key":"52_CR7","first-page":"704","volume":"E83-A","author":"H. Ito","year":"2000","unstructured":"Ito, H., Uehara, H., Yokoyama, M.: A faster and flexible algorithm for a location problem on undirected flow networks. IEICE Trans.\u00a0E83-A, 704\u2013712 (2000)","journal-title":"IEICE Trans."},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/S0097539701397813","volume":"32","author":"S. Iwata","year":"2003","unstructured":"Iwata, S.: A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput.\u00a032, 833\u2013840 (2003)","journal-title":"SIAM J. Comput."},{"key":"52_CR9","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S. Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. of ACM\u00a048, 761\u2013777 (2001)","journal-title":"J. of ACM"},{"key":"52_CR10","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719802","volume-title":"Topics in Intersection Graph Theory","author":"T.A. Mckee","year":"1999","unstructured":"Mckee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)"},{"key":"52_CR11","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A. Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B\u00a080, 346\u2013355 (2000)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"52_CR12","first-page":"678","volume":"E75-A","author":"H. Tamura","year":"1992","unstructured":"Tamura, H., Sengoku, M., Shinoda, S., Abe, T.: Some covering problems in location theory on flow networks. IEICE Trans.\u00a0E75-A, 678\u2013683 (1992)","journal-title":"IEICE Trans."},{"key":"52_CR13","first-page":"863","volume":"J81-A","author":"H. Tamura","year":"1998","unstructured":"Tamura, H., Sugawara, H., Sengoku, M., Shinoda, S.: Plural cover problem on undirected flow networks. IEICE Trans.\u00a0J81-A, 863\u2013869 (1998) (in Japanese)","journal-title":"IEICE Trans."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:56Z","timestamp":1619507816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11841036_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}