乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:34:18Z","timestamp":1725834858284},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252575"},{"type":"electronic","value":"9783319252582"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_17","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T07:10:18Z","timestamp":1445238618000},"page":"239-253","source":"Crossref","is-referenced-by-count":3,"title":["A Faster Computation of All the Best Swap Edges of a Tree Spanner"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Feliciano","family":"Colella","sequence":"additional","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"17_CR1","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In: Proc. of the 18th ACM-SIAM Symp. on Discrete Algorithms (SODA 2007), pp. 502\u2013511. ACM Press (2007)"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1103963.1103966","volume":"1","author":"S. Alstrup","year":"2005","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms\u00a01(2), 243\u2013264 (2005)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00453-012-9674-y","volume":"68","author":"D. Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: Finding best swap edges minimizing the routing cost of a spanning tree. Algorithmica\u00a068(2), 337\u2013357 (2014)","journal-title":"Algorithmica"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: A faster computation of all the best swap edges of a shortest paths tree. Algorithmica (in press). doi:10.1007\/s00453-014-9912-6","DOI":"10.1007\/s00453-014-9912-6"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/jagm.1998.0962","volume":"30","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Chepoi, V., Dragan, F.F.: Distance approximating trees for chordal and dually chordal graphs. Journal of Algorithms\u00a030(1), 166\u2013184 (1999)","journal-title":"Journal of Algorithms"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L. Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Tree spanners. SIAM J. on Disc. Math.\u00a08, 359\u2013387 (1995)","journal-title":"SIAM J. on Disc. Math."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.7155\/jgaa.00208","volume":"14","author":"S. Das","year":"2010","unstructured":"Das, S., Gfeller, B., Widmayer, P.: Computing all best swaps for minimum-stretch tree spanners. J. of Graph Algorithms and Applications\u00a014(2), 287\u2013306 (2010)","journal-title":"J. of Graph Algorithms and Applications"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2007.03.046","volume":"383","author":"A. Salvo Di","year":"2007","unstructured":"Di Salvo, A., Proietti, G.: Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. Theor. Comp. Science\u00a0383(1), 23\u201333 (2007)","journal-title":"Theor. Comp. Science"},{"issue":"5","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/060666202","volume":"38","author":"Y. Emek","year":"2008","unstructured":"Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs. SIAM Journal on Computing\u00a038(5), 1761\u20131781 (2008)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/PL00009225","volume":"22","author":"G.F. Italiano","year":"1998","unstructured":"Italiano, G.F., Ramaswami, R.: Maintaining spanning trees of small diameter. Algorithmica\u00a022(3), 275\u2013304 (1998)","journal-title":"Algorithmica"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.dam.2007.07.001","volume":"156","author":"C. Liebchen","year":"2008","unstructured":"Liebchen, C., W\u00fcnsch, G.: The zoo of tree spanner problems. Discrete Applied Mathematics\u00a0156, 569\u2013587 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"17_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.7155\/jgaa.00039","volume":"5","author":"E. Nardelli","year":"2001","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. Journal of Graph Algorithms and Applications\u00a05(5), 39\u201357 (2001)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1007\/11602613_96","volume-title":"Algorithms and Computation","author":"S. Pettie","year":"2005","unstructured":"Pettie, S.: Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 964\u2013973. Springer, Heidelberg (2005)"},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-007-9080-z","volume":"50","author":"B.Y. Wu","year":"2008","unstructured":"Wu, B.Y., Hsiao, C.-Y., Chao, K.-M.: The swap edges of a multiple-sources routing tree. Algorithmica\u00a050(3), 299\u2013311 (2008)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:54:00Z","timestamp":1559289240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}