乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:56:35Z","timestamp":1730328995845,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780568","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T13:18:43Z","timestamp":1082380723000},"page":"167-176","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A fast algorithm for computing steiner edge connectivity"],"prefix":"10.1145","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[{"name":"New York University, NY, NY"}]},{"given":"Ramesh","family":"Hariharan","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/103418.103437"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1137\/S0036142993226983"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 12th Annual Symposium on Discrete Algorithms","author":"Cole R.","year":"2001","unstructured":"R. Cole , R. Hariharan , M. Lewenstein , E. Porat . A Faster Implementation of the Goemans Williamson Clustering Algorithm . Proceedings of the 12th Annual Symposium on Discrete Algorithms , 2001 . R. Cole, R. Hariharan, M. Lewenstein, E. Porat. A Faster Implementation of the Goemans Williamson Clustering Algorithm. Proceedings of the 12th Annual Symposium on Discrete Algorithms, 2001."},{"key":"e_1_3_2_1_4_1","first-page":"240","volume-title":"Ed.","author":"Dinits E.A.","year":"1976","unstructured":"E.A. Dinits , A.V. Karzanov , M.V. Lomonosov . On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization, A.A. Fridman , Ed. , pp. 240 -- 306 , 1976 . (Original article in Russian, translation available from National Translation Center, Library of Congress, Cataloging Distribution Center, Washington D.C , 20541 (NTC 89-20265)). E.A. Dinits, A.V. Karzanov, M.V. Lomonosov. On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization, A.A. Fridman, Ed., pp. 240--306, 1976. (Original article in Russian, translation available from National Translation Center, Library of Congress, Cataloging Distribution Center, Washington D.C, 20541 (NTC 89-20265))."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/195058.195442"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/PL00009195"},{"key":"e_1_3_2_1_7_1","first-page":"69","volume-title":"Proceedings of the Calgary International Conference on Combinatorial Structures and their Application, Gordon and Breach","author":"Edmonds J.","year":"1969","unstructured":"J. Edmonds . Submodular functions, matroids, and certain polyhedra . Proceedings of the Calgary International Conference on Combinatorial Structures and their Application, Gordon and Breach , New York , 1969 , pp. 69 -- 87 . J. Edmonds. Submodular functions, matroids, and certain polyhedra. Proceedings of the Calgary International Conference on Combinatorial Structures and their Application, Gordon and Breach, New York, 1969, pp. 69--87."},{"key":"e_1_3_2_1_8_1","first-page":"91","volume-title":"Edge Disjoint Branchings","author":"Edmonds J.","year":"1972","unstructured":"J. Edmonds . Edge Disjoint Branchings . Combinatorial Algorithms, R. Rustin, editor, Algorithmics Press , NY , 1972 , pp. 91 -- 96 . J. Edmonds. Edge Disjoint Branchings. Combinatorial Algorithms, R. Rustin, editor, Algorithmics Press, NY, 1972, pp. 91--96."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1006\/jagm.1999.1039"},{"key":"e_1_3_2_1_10_1","first-page":"63","article-title":"Kernel systems of directed graphs","volume":"41","author":"Frank A.","year":"1979","unstructured":"A. Frank . Kernel systems of directed graphs . Acta Sci. Math. , 41 , 1979 , pp. 63 -- 76 . A. Frank. Kernel systems of directed graphs. Acta Sci. Math., 41, 1979, pp. 63--76.","journal-title":"Acta Sci. Math."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/SFCS.1991.185453"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/103418.103436"},{"key":"e_1_3_2_1_13_1","first-page":"57","volume-title":"Proceedings of IPCO","author":"Gabow H.","year":"1993","unstructured":"H. Gabow , M. Goemans , D. Williamson . An efficient approximation algorithm for the survivable network design problem , Proceedings of IPCO , pp. 57 -- 74 , 1993 . To appear in Math. Programming. H. Gabow, M. Goemans, D. Williamson. An efficient approximation algorithm for the survivable network design problem, Proceedings of IPCO, pp. 57--74, 1993. To appear in Math. Programming."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/645901.758331"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_16_1","volume-title":"Handbook of Operations Research and Management Science","author":"Grotschel M.","year":"1993","unstructured":"M. Grotschel , C.L. Monma , M. Stoer . Design of Survivable Networks , Handbook of Operations Research and Management Science , 1993 . M. Grotschel, C.L. Monma, M. Stoer. Design of Survivable Networks, Handbook of Operations Research and Management Science, 1993."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1007\/s004930170004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1016\/0020-0190(94)00156-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1016\/0095-8956(76)90049-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/BF01758778"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/0020-0190(74)90024-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/0020-0190(83)90073-X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1007\/BF01299747"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC03","name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","location":"San Diego CA USA"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:33:21Z","timestamp":1672965201000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":23,"alternative-id":["10.1145\/780542.780568","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780568","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}