{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T23:51:03Z","timestamp":1784850663846,"version":"3.55.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T00:00:00Z","timestamp":1330041600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10878-012-9462-2","type":"journal-article","created":{"date-parts":[[2012,2,23]],"date-time":"2012-02-23T16:56:24Z","timestamp":1330016184000},"page":"709-722","source":"Crossref","is-referenced-by-count":21,"title":["Finding paths with minimum shared edges"],"prefix":"10.1007","volume":"26","author":[{"given":"Masoud T.","family":"Omran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,2,24]]},"reference":[{"issue":"1","key":"9462_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01585705","volume":"53","author":"RK Ahuja","year":"1992","unstructured":"Ahuja RK, Goldberg AV, Orlin JB, Tarjan RE (1992) Finding minimum-cost flows by double scaling. Math Program 53(1):243\u2013266","journal-title":"Math Program"},{"key":"9462_CR2","series-title":"Lecture notes comput sci","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/11602569_48","volume-title":"Proc 12th internat conf high perform comput","author":"D Bader","year":"2005","unstructured":"Bader D, Madduri K (2005) Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In: Proc 12th internat conf high perform comput. Lecture notes comput sci, vol\u00a03769, pp 465\u2013476"},{"issue":"2","key":"9462_CR3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1109\/7.53448","volume":"26","author":"DA Castanon","year":"1990","unstructured":"Castanon DA (1990) Efficient algorithms for finding the k best paths through a trellis. IEEE Trans Aerosp Electron Syst 26(2):405\u2013410","journal-title":"IEEE Trans Aerosp Electron Syst"},{"key":"9462_CR4","series-title":"Lecture notes comput sci","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-642-04128-0_3","volume-title":"Proc 17th annu European sympos algorithms","author":"M Charikar","year":"2009","unstructured":"Charikar M, Hajiaghayi M, Karloff H (2009) Improved approximation algorithms for label cover problems. In: Proc 17th annu European sympos algorithms. Lecture notes comput sci, vol\u00a05757, pp 23\u201334"},{"issue":"1","key":"9462_CR5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/1077464.1077470","volume":"1","author":"G Even","year":"2005","unstructured":"Even G, Kortsarz G, Slany W (2005) On network design problems: fixed cost flows and the covering steiner problem. ACM Trans Algorithms 1(1):74\u2013101","journal-title":"ACM Trans Algorithms"},{"key":"9462_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"issue":"5","key":"9462_CR7","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"AV Goldberg","year":"1998","unstructured":"Goldberg AV, Rao S (1998) Beyond the flow decomposition barrier. J ACM 45(5):783\u2013797","journal-title":"J ACM"},{"issue":"3","key":"9462_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"A Itai","year":"1982","unstructured":"Itai A, Perl Y, Shiloach Y (1982) The complexity of finding maximum disjoint paths with length constraints. Networks 12(3):277\u2013286","journal-title":"Networks"},{"issue":"4","key":"9462_CR9","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.disopt.2010.05.002","volume":"7","author":"Y Kobayashi","year":"2010","unstructured":"Kobayashi Y, Sommer C (2010) On shortest disjoint paths in planar graphs. Discrete Optim 7(4):234\u2013245","journal-title":"Discrete Optim"},{"key":"9462_CR10","first-page":"158","volume-title":"Proc internat conf oper res: OR-98","author":"SO Krumke","year":"1998","unstructured":"Krumke SO, Noltemeier H, Schwarz S, Wirth H-C, Ravi R (1998) Flow improvement and network flows with fixed costs. In: Proc internat conf oper res: OR-98, pp 158\u2013167"},{"issue":"4","key":"9462_CR11","first-page":"586","volume":"E82-B","author":"S-W Lee","year":"1999","unstructured":"Lee S-W, Wu C-S (1999) A k-best paths algorithm for highly reliable communication networks. IEICE Trans Commun E82-B(4):586\u2013590","journal-title":"IEICE Trans Commun"},{"issue":"1","key":"9462_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0166-218X(90)90024-7","volume":"26","author":"C Li","year":"1989","unstructured":"Li C, McCormick TS, Simich-Levi D (1989) The complexity of finding two disjoint paths with min-max objective function. Discrete Appl Math 26(1):105\u2013115","journal-title":"Discrete Appl Math"},{"issue":"7","key":"9462_CR13","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1002\/net.3230220705","volume":"22","author":"C Li","year":"1992","unstructured":"Li C, McCormick ST, Simchi-Levi D (1992) Finding disjoint paths with different path-costs: complexity and algorithms. Networks 22(7):653\u2013667","journal-title":"Networks"},{"key":"9462_CR14","first-page":"370","volume-title":"Proc 16th IEEE internat conf comput commun","author":"SD Nikolopoulos","year":"1997","unstructured":"Nikolopoulos SD, Pitsillides A, Tipper D (1997) Addressing network survivability issues by finding the k-best paths through a trellis graph. In: Proc 16th IEEE internat conf comput commun, pp\u00a0370\u2013377"},{"issue":"2","key":"9462_CR15","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"JW Suurballe","year":"1984","unstructured":"Suurballe JW, Tarjan RE (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14(2):325\u2013336","journal-title":"Networks"},{"issue":"1","key":"9462_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TNET.2005.863451","volume":"14","author":"D Xu","year":"2006","unstructured":"Xu D, Chen Y, Xiong Y, Qiao C, He X (2006) On the complexity of and algorithms for finding the shortest path with a disjoint counterpart. IEEE\/ACM Trans Netw 14(1):147\u2013158","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9462_CR17","first-page":"1532","volume-title":"Proc 26th IEEE internat conf comput commun","author":"SQ Zheng","year":"2007","unstructured":"Zheng SQ, Yang B, Yang M, Wang J (2007) Finding minimum-cost paths with minimum sharability. In: Proc 26th IEEE internat conf comput commun, pp 1532\u20131540"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9462-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9462-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9462-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:17Z","timestamp":1559276597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9462-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,24]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9462"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9462-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,24]]}}}