{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:25:45Z","timestamp":1761488745672,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_49","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"567-578","source":"Crossref","is-referenced-by-count":3,"title":["Finding Paths with Minimum Shared Edges"],"prefix":"10.1007","author":[{"given":"Masoud T.","family":"Omran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"49_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01585705","volume":"53","author":"R.K. Ahuja","year":"1992","unstructured":"Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Mathematical Programming\u00a053(1), 243\u2013266 (1992)","journal-title":"Mathematical Programming"},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11602569_48","volume-title":"High Performance Computing \u2013 HiPC 2005","author":"D.A. Bader","year":"2005","unstructured":"Bader, D.A., Madduri, K.: Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds.) HIPC 2005. LNCS, vol.\u00a03769, pp. 465\u2013476. Springer, Heidelberg (2005)"},{"issue":"2","key":"49_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/7.53448","volume":"26","author":"D.A. Castanon","year":"1990","unstructured":"Castanon, D.A.: Efficient algorithms for finding the k best paths through a trellis. IEEE Trans. Aerospace and Electronic Systems\u00a026(2), 405\u2013410 (1990)","journal-title":"IEEE Trans. Aerospace and Electronic Systems"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-04128-0_3","volume-title":"Algorithms - ESA 2009","author":"M. Charikar","year":"2009","unstructured":"Charikar, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for label cover problems. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 23\u201334. Springer, Heidelberg (2009)"},{"issue":"1","key":"49_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1077464.1077470","volume":"1","author":"G. Even","year":"2005","unstructured":"Even, G., Kortsarz, G., Slany, W.: On network design problems: fixed cost flows and the covering steiner problem. ACM Trans. Algorithms\u00a01(1), 74\u2013101 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"49_CR6","volume-title":"Computers and intractability : A guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)"},{"issue":"5","key":"49_CR7","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM\u00a045(5), 783\u2013797 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"49_CR8","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.disopt.2010.05.002","volume":"7","author":"Y. Kobayashi","year":"2010","unstructured":"Kobayashi, Y., Sommer, C.: On shortest disjoint paths in planar graphs. Discrete Optimization\u00a07(4), 234\u2013245 (2010)","journal-title":"Discrete Optimization"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Krumke, S.O., Noltemeier, H., Schwarz, S., Wirth, H.-C., Ravi, R.: Flow improvement and network flows with fixed costs. In: Proc. Internat. Conf. Oper. Res., OR 1998, pp. 158\u2013167 (1998)","DOI":"10.1007\/978-3-642-58409-1_15"},{"issue":"4","key":"49_CR10","first-page":"586","volume":"E82-B","author":"S.-W. Lee","year":"1999","unstructured":"Lee, S.-W., Wu, C.-S.: A k-best paths algorithm for highly reliable communication networks. IEICE Trans. Commun.\u00a0E82-B(4), 586\u2013590 (1999)","journal-title":"IEICE Trans. Commun."},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Nikolopoulos, S.D., Pitsillides, A., Tipper, D.: Addressing network survivability issues by finding the k-best paths through a trellis graph. In: Proc. 16th IEEE Internat. Conf. Comput. Commun., pp. 370\u2013377 (1997)","DOI":"10.1109\/INFCOM.1997.635161"},{"issue":"2","key":"49_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J.W. Suurballe","year":"1984","unstructured":"Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks\u00a014(2), 325\u2013336 (1984)","journal-title":"Networks"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Zheng, S.Q., Yang, B., Yang, M., Wang, J.: Finding minimum-cost paths with minimum sharability. In: Proc. 26th IEEE Internat. Conf. Comput. Commun., pp. 1532\u20131540 (2007)","DOI":"10.1109\/INFCOM.2007.180"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T13:22:23Z","timestamp":1741440143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}