乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T05:53:39Z","timestamp":1720590819500},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1006\/jagm.1998.0930","type":"journal-article","created":{"date-parts":[[2002,10,6]],"date-time":"2002-10-06T16:51:01Z","timestamp":1033923061000},"page":"142-171","source":"Crossref","is-referenced-by-count":129,"title":["Bicriteria Network Design Problems"],"prefix":"10.1006","volume":"28","author":[{"given":"Madhav V","family":"Marathe","sequence":"first","affiliation":[]},{"given":"R","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[]},{"given":"S.S","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Daniel J","family":"Rosenkrantz","sequence":"additional","affiliation":[]},{"suffix":"III","given":"Harry B","family":"Hunt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jagm.1998.0930_AL980930RF1","series-title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (STOC)","article-title":"Improved low-degree testing and its applications","author":"Arora","year":"1997"},{"key":"10.1006\/jagm.1998.0930_AL980930RF2","series-title":"Proceedings of the Ninth Symposium on Principles of Distributed Computing (PODC)","article-title":"Cost-sensitive analysis of communication protocols","author":"Awerbuch","year":"1990"},{"key":"10.1006\/jagm.1998.0930_AL980930RF3","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","article-title":"An algebraic theory of graph reductions","volume":"40","author":"Arnborg","year":"1993","journal-title":"J. ACM (JACM)"},{"key":"10.1006\/jagm.1998.0930_AL980930RF4","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/S0097539792236237","article-title":"When trees collide: an approximation algorithm for the generalized Steiner problem on networks","volume":"24","author":"Agrawal","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jagm.1998.0930_AL980930RF5","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1006\/jagm.1998.0930_AL980930RF6","series-title":"Proceedings of the Fifteenth International Colloquium on Automata Language and Programming","article-title":"Dynamic programming on graphs of bounded treewidth","volume":"317","author":"Bodlaender","year":"1988"},{"key":"10.1006\/jagm.1998.0930_AL980930RF7","series-title":"Proceedings of the Thirteenth ACM-SIGIR","article-title":"Construction of optimal graphs for bit-vector compression","author":"Bookstein","year":"1990"},{"key":"10.1006\/jagm.1998.0930_AL980930RF8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear-time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1006\/jagm.1998.0930_AL980930RF9","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0603048","article-title":"The bounded path problems","volume":"3","author":"Camerini","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1006\/jagm.1998.0930_AL980930RF10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230070405","article-title":"Minimum ratio spanning trees","volume":"7","author":"Chandrasekaran","year":"1977","journal-title":"Networks"},{"key":"10.1006\/jagm.1998.0930_AL980930RF11","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1006\/jagm.1998.0930_AL980930RF12","series-title":"Proceedings of IEEE INFOCOM 1991","article-title":"On multicast path finding algorithms","author":"Chow","year":"1991"},{"key":"10.1006\/jagm.1998.0930_AL980930RF13","unstructured":"P. Crescenzi, V. Kann, A compendium ofNP, 1995"},{"key":"10.1006\/jagm.1998.0930_AL980930RF14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/MS.1985.230701","article-title":"Multicast communication in network computers","volume":"2","author":"Frank","year":"1985","journal-title":"IEEE Software"},{"key":"10.1006\/jagm.1998.0930_AL980930RF15","series-title":"Proceedings of the First Conference on Combinatorics and Computing (COCOON)","article-title":"The multi-weighted spanning tree problem","author":"Ganley","year":"1995"},{"key":"10.1006\/jagm.1998.0930_AL980930RF16","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1006\/jagm.1998.0930_AL980930RF17","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","article-title":"A general approximation technique for constrained forest problems","volume":"24","author":"Goemans","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jagm.1998.0930_AL980930RF18","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path problem","volume":"17","author":"Hassin","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1006\/jagm.1998.0930_AL980930RF19","series-title":"Proceedings of the Annual ACM Symposium on Computational Geometry","article-title":"Bounded diameter spanning tree and related problems","author":"Ho","year":"1989"},{"key":"10.1006\/jagm.1998.0930_AL980930RF20","series-title":"Approximation Algorithms for NP-Hard Problems","author":"Hochbaum","year":"1997"},{"key":"10.1006\/jagm.1998.0930_AL980930RF21","first-page":"343","article-title":"Routing to multiple destinations in computer networks","volume":"COM-31","author":"Kadaba","year":"1983","journal-title":"IEEE Trans. Commun."},{"key":"10.1006\/jagm.1998.0930_AL980930RF22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01294129","article-title":"Balancing minimum spanning and shortest path trees","volume":"14","author":"Khuller","year":"1995","journal-title":"Algorithmica"},{"key":"10.1006\/jagm.1998.0930_AL980930RF23","series-title":"Proceedings of IEEE INFOCOM 1992","article-title":"Multicasting for multimedia applications","author":"Kompella","year":"1992"},{"key":"10.1006\/jagm.1998.0930_AL980930RF24","series-title":"IEEE\/ACM Transactions on Networking","article-title":"Multicast routing for multimedia communication","author":"Kompella","year":"1993"},{"key":"10.1006\/jagm.1998.0930_AL980930RF25","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0895480193245923","article-title":"Approximation algorithms for minimum time broadcast","volume":"8","author":"Kortsarz","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1006\/jagm.1998.0930_AL980930RF26","series-title":"Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","article-title":"Approximating shallow light trees","author":"Kortsarz","year":"1997"},{"key":"10.1006\/jagm.1998.0930_AL980930RF27","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1006\/jagm.1998.0930_AL980930RF28","series-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing","article-title":"The network inhibition problem","author":"Phillips","year":"1993"},{"key":"10.1006\/jagm.1998.0930_AL980930RF29","series-title":"Proceedings of the Thirty-Fifth Annual IEEE Foundations of Computer Science","article-title":"Rapid rumor ramification: approximating the minimum broadcast time","author":"Ravi","year":"1994"},{"key":"10.1006\/jagm.1998.0930_AL980930RF30","series-title":"Proceedings of the Fifth Scandinavian Workshop on Algorithmic Theory","article-title":"The constrained spanning tree problem","volume":"1097","author":"Ravi","year":"1996"},{"key":"10.1006\/jagm.1998.0930_AL980930RF31","series-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing","article-title":"Many birds with one stone: multi-objective approximation algorithms","author":"Ravi","year":"1993"},{"key":"10.1006\/jagm.1998.0930_AL980930RF32","series-title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing","article-title":"A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP","author":"Raz","year":"1997"},{"key":"10.1006\/jagm.1998.0930_AL980930RF33","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of Pareto optima in multiple-objective, shortest path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Oper. Res."},{"key":"10.1006\/jagm.1998.0930_AL980930RF34","unstructured":"Q. Zhu, M. Parsa, W. W. M. Dai, An Iterative Approach for Delay-Bounded Minimum Steiner Tree Construction, UCSC-CRL-94-39, UC Santa Cruz, 1994"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677498909300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677498909300?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T22:58:40Z","timestamp":1557269920000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677498909300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0196677498909300"],"URL":"https:\/\/doi.org\/10.1006\/jagm.1998.0930","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}