{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T05:41:20Z","timestamp":1761716480468},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152504"},{"type":"electronic","value":"9783642152511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15251-1_11","type":"book-chapter","created":{"date-parts":[[2010,8,12]],"date-time":"2010-08-12T14:55:45Z","timestamp":1281624945000},"page":"149-158","source":"Crossref","is-referenced-by-count":9,"title":["Minimum Spanning Tree on Spatio-Temporal Networks"],"prefix":"10.1007","author":[{"given":"Viswanath","family":"Gunturi","sequence":"first","affiliation":[]},{"given":"Shashi","family":"Shekhar","sequence":"additional","affiliation":[]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Huang, G., Li, X., He, J.: Dynamic minimal spanning tree routing protocol for large wireless sensor networks. In: IEEE Conf. Industrial Electronics and Applications (IEA), pp. 1531\u20131535 (2006)","DOI":"10.1109\/ICIEA.2006.257220"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MCOM.2005.1404592","volume":"43","author":"S. Muruganathan","year":"2005","unstructured":"Muruganathan, S., Ma, D., Bhasin, R., Fapojuwo, A.: A centralized energy-efficient routing protocol for wireless sensor networks. IEEE Comm. Mag.\u00a043, 8\u201313 (2005)","journal-title":"IEEE Comm. Mag."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Yoon, S., Qiao, C.: A novel approach to reconnaissance using cooperative mobile sensor nodes. In: Military Communications Conf. (MILCOM), pp. 1\u20137 (2006)","DOI":"10.1109\/MILCOM.2006.302266"},{"key":"11_CR4","volume-title":"Algorithm Design","author":"J. Kleinberg","year":"2009","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education, London (2009)"},{"key":"11_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"G. Frederickson","year":"1985","unstructured":"Frederickson, G.: Data structures for on-line updating of minimum spanning trees. SIAM J. Computing\u00a014, 781\u2013798 (1985)","journal-title":"SIAM J. Computing"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., King, V.: Maintaining minimum spanning trees in dynamic graphs. In: Int. Coll. Automata, Languages, and Programming, pp. 594\u2013604 (1997)","DOI":"10.1007\/3-540-63165-8_214"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: IEEE Symp. Foundations of Computer Science (FOCS), pp. 596\u2013605 (1998)","DOI":"10.1109\/SFCS.1998.743510"},{"key":"11_CR9","unstructured":"Guibas, L.J.: Kinetic data structures: a state of the art report. In: Workshop on Algorithmic Foundations of Robotics (WAFR), pp. 191\u2013209 (1998)"},{"key":"11_CR10","unstructured":"Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. In: ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 747\u2013756 (1997)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: ACM Symp. Theory of Computing (STOC), pp. 114\u2013122 (1981)","DOI":"10.1145\/800076.802464"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-540-73540-3_26","volume-title":"Advances in Spatial and Temporal Databases","author":"B. George","year":"2007","unstructured":"George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: A summary of results. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol.\u00a04605, pp. 460\u2013477. Springer, Heidelberg (2007)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"George, B., Shekhar, S.: Time-aggregated graphs for modelling spatio-temporal networks. J. Semantics of Data\u00a0XI, 191 (2007)","DOI":"10.1007\/978-3-540-92148-6_7"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Gunturi, V., Shekhar, S., Bhattacharya, A.: Minimum spanning tree on spatio-temporal networks (2010), arXiv:1003.1251v2 [cs.DS]","DOI":"10.1007\/978-3-642-15251-1_11"},{"key":"11_CR15","volume-title":"Data Structures and Algorithms","author":"V.A. Alfred","year":"1983","unstructured":"Alfred, V.A., Ullman, J.D., Hopcroft, J.E.: Data Structures and Algorithms. Addison-Wesley Longman, Amsterdam (1983)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15251-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:03:53Z","timestamp":1606187033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15251-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152504","9783642152511"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15251-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}