乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:33Z","timestamp":1725664233231},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600848"},{"type":"electronic","value":"9783540494256"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60084-1_99","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:39:00Z","timestamp":1330259940000},"page":"487-498","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Bicriteria network design problems"],"prefix":"10.1007","author":[{"given":"M. V.","family":"Marathe","sequence":"first","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"R.","family":"Sundaram","sequence":"additional","affiliation":[]},{"given":"S. S.","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"D. J.","family":"Rosenkrantz","sequence":"additional","affiliation":[]},{"suffix":"III","given":"H. B.","family":"Hunt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren and D. Seese, \u201cEasy Problems for Tree-Decomposable Graphs,\u201d J. Algorithms, Vol. 12, 1991, pp. 308\u2013340.","journal-title":"J. Algorithms"},{"key":"42_CR2","first-page":"308","volume":"12","author":"S. Arnborg","year":"1993","unstructured":"S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, \u201cAn Algebraic Theory of Graph Problems,\u201d J. ACM, Vol. 12, 1993, pp. 308\u2013340.","journal-title":"J. ACM"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Baratz, and D. Peleg, \u201cCost-sensitive analysis of communication protocols,\u201d Proc. of 9th Symp. on Principles of Distributed Computing (PODC), pp. 177\u2013187, (1990).","DOI":"10.1145\/93385.93417"},{"key":"42_CR4","unstructured":"M. Bellare, S. Goldwasser, C. Lund, and A. Russell, \u201cEfficient probabilistically checkable proofs,\u201d Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (1993), pp. 294\u2013304."},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M.W. Bern","year":"1987","unstructured":"M.W. Bern, E.L. Lawler and A.L. Wong, \u201cLinear-Time Computation of Optimal Subgraphs of Decomposable Graphs,\u201d J. Algorithms, Vol. 8, 1987, pp. 216\u2013235.","journal-title":"J. Algorithms"},{"key":"42_CR6","first-page":"105","volume":"317","author":"H.L. Bodlaender","year":"1988","unstructured":"H.L. Bodlaender, \u201cDynamic programming on graphs of bounded treewidth,\u201d Proc. of the 15th ICALP, LNCS Vol. 317, 1988, pp. 105\u2013118.","journal-title":"LNCS"},{"issue":"No.4","key":"42_CR7","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0603048","volume":"3","author":"P. M. Camerini","year":"1982","unstructured":"P. M. Camerini, and G. Galbiati, \u201cThe bounded path problem,\u201d SIAM J. Alg. Disc., Meth. Vol. 3, No. 4 (1982), pp. 474\u2013484.","journal-title":"SIAM J. Alg. Disc., Meth."},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"C.-H. Chow, \u201cOn multicast path finding algorithms,\u201d Proc. of IEEE INFOCOM '91, pp. 1274\u20131283 (1991).","DOI":"10.1109\/INFCOM.1991.147651"},{"issue":"No.3","key":"42_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/MS.1985.230701","volume":"2","author":"A. Frank","year":"1985","unstructured":"A. Frank, L. Wittie, and A. Bernstein, \u201cMulticast communication in network computers,\u201d IEEE Software, Vol. 2, No. 3, pp. 49\u201361 (1985).","journal-title":"IEEE Software"},{"key":"42_CR10","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman, San Francisco (1979)."},{"issue":"No.1","key":"42_CR11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"R. Hassin, \u201cApproximation schemes for the restricted shortest path problem,\u201d Math. of O. R., Vol. 17, No. 1, pp. 36\u201342 (1992).","journal-title":"Math. of O. R."},{"key":"42_CR12","first-page":"343","volume":"COM-31","author":"B. Kadaba","year":"1983","unstructured":"B. Kadaba and J. Jaffe, \u201cRouting to multiple destinations in computer networks,\u201d IEEE Trans. on Comm., Vol. COM-31, pp. 343\u2013351, (Mar. 1983).","journal-title":"IEEE Trans. on Comm."},{"key":"42_CR13","unstructured":"S. Khuller, B. Raghavachari, and N. Young, \u201cBalancing Minimum Spanning and Shortest Path Trees,\u201c Proc., Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993), pp. 243\u2013250."},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"V.P. Kompella, J.C. Pasquale and G.C. Polyzos, \u201cMulticasting for multimedia applications,\u201d Proc. of IEEE INFOCOM '92, (May 1992).","DOI":"10.1109\/INFCOM.1992.263480"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"V.P. Kompella, J.C. Pasquale and G.C. Polyzos, \u201cMulticast Routing for Multimedia Communication,\u201d IEEE\/ACM Transactions on Networking, pp. 286\u2013292, (1993).","DOI":"10.1109\/90.234851"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"G. Kortsarz and D. Peleg, \u201cApproximation algorithms for minimum time broadcast,\u201d Proc. of the 1992 Israel Symposium on Theoretical Computer Science LNCS 601, (1994).","DOI":"10.1007\/BFb0035167"},{"key":"42_CR17","unstructured":"C. Lund and M. Yannakakis, \u201cOn the Hardness of Approximating Minimization Problems,\u201d Proc., 25th Annual ACM Symp. on Theory of Computing, (1993), pp. 286\u2013293."},{"key":"42_CR18","unstructured":"R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H.B. Hunt III, \u201cMany birds with one stone: Multi-objective approximation algorithms,\u201d Proc. of the 25th Annual ACM Symposium on the Theory of Computing (1993), pp. 438\u2013447."},{"key":"42_CR19","unstructured":"R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, and S. S. Ravi, \u201cSpanning trees short or small,\u201d in Proc. of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, (1994), pp 546\u2013555."},{"key":"42_CR20","unstructured":"R. Ravi, \u201cRapid Rumor Ramification: Approximating the minimum broadcast time,\u201d in Proc. of the 25th Annual IEEE Foundations of Computer Science (1994), pp. 202\u2013213."},{"key":"42_CR21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","volume":"48","author":"N. Robertson","year":"1990","unstructured":"N. Robertson and P. Seymour, \u201cGraph Minors IV, Tree-width and wellquasi-ordering,\u201d J. Combin. Theory Ser. B 48, 227\u2013254 (1990).","journal-title":"J. Combin. Theory Ser. B"},{"key":"42_CR22","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"A. Warburton, \u201cApproximation of Pareto optima in multiple-objective, shortest path problems,\u201d Oper. Res. 35, pp. 70\u201379 (1987).","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60084-1_99","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T13:13:12Z","timestamp":1580303592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60084-1_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600848","9783540494256"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-60084-1_99","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}