{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:22:37Z","timestamp":1778692957400,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cluster Computing"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1023\/a:1019045801829","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T17:49:22Z","timestamp":1045676962000},"page":"237-248","source":"Crossref","is-referenced-by-count":60,"title":["Spine routing in ad hoc networks"],"prefix":"10.1007","volume":"1","author":[{"given":"Raghupathy","family":"Sivakumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bevan","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaduvur","family":"Bharghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"327427_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in: Proceedings of the 19th Annual ACM Symposium on Theory of Computing(1987) pp. 230-240.","DOI":"10.1145\/28395.28421"},{"key":"327427_CR2","unstructured":"S. Corson, J. Macker and S. Batsell, Architectural considerations for mobile mesh networking, at Internet DRAFT RFC Version 2, May 1996, http:\/\/tonnant.itd.nrl.navy.mil\/mmnet\/mmnetRFC.txt."},{"key":"327427_CR3","unstructured":"B. Das and V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, in: IEEE International Conference on Communications(ICC' 97) (June 1997)."},{"key":"327427_CR4","unstructured":"B. Das and M.C. Loui, Algorithms for all single deletions in a minimum spanning tree, simultaneously, Technical Report UILU-ENG-95-2241, ACT-136, Coord. Sci. Lab., University of Illinois, Urbana-Champaign (1995)."},{"key":"327427_CR5","doi-asserted-by":"crossref","unstructured":"B. Das, R. Sivakumar and V. Bharghavan, Routing in ad-hoc networks using a virtual backbone, in: 6th International Conference on248 R. Sivakumar et al. \/ Spine routing in ad hoc networks Computer Communications and Networks(IC3N' 97) (September 1997) pp. 1-20.","DOI":"10.1109\/ICC.1997.605303"},{"key":"327427_CR6","doi-asserted-by":"crossref","unstructured":"M. Faloutsos and M. Molle, Optimal distributed algorithm for minimum spanning trees revisited, in: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing(1995) pp. 231-237.","DOI":"10.1145\/224964.225474"},{"issue":"1","key":"327427_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"R.G. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transactions Programming Languages Systems 5(1) (1983) 66-77.","journal-title":"ACM Transactions Programming Languages Systems"},{"key":"327427_CR8","doi-asserted-by":"crossref","unstructured":"J.A. Garay, S. Kutten and D. Peleg, A sub-linear time distributed algorithm for minimum-weight spanning trees, in: Proceedings of the 34th Annual Symposium on Foundations of Computer Science(1993) pp. 659-668.","DOI":"10.1109\/SFCS.1993.366821"},{"key":"327427_CR9","volume-title":"Computers and Intractablility: A Guide to the Theory of NP-Completeness","author":"M.L. Garey","year":"1979","unstructured":"M.L. Garey and D.S. Johnson, Computers and Intractablility: A Guide to the Theory of NP-Completeness(W.H. Freeman, San Francisco, 1979)."},{"issue":"3","key":"327427_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01200845","volume":"1","author":"M. Gerla","year":"1995","unstructured":"M. Gerla and J.T.-C. Tsai, Multicluster, mobile, multimedia radio network, ACM J. Wireless Networks 1(3) (1995) 255-265.","journal-title":"ACM J. Wireless Networks"},{"key":"327427_CR11","doi-asserted-by":"crossref","unstructured":"S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Technical Report 3660, University of Maryland Institute for Advanced Computer Studies-Department of Computer Science, University of Maryland, College Park (June 1996).","DOI":"10.1007\/3-540-61680-2_55"},{"key":"327427_CR12","unstructured":"D.A. Hall, Tactical Internet system architecture for task force XXI, in: Proceedings of the Tactical Communications Conference, Ft. Wayne (May 1996)."},{"key":"327427_CR13","volume-title":"Mobile Computing","author":"D.B. Johnson","year":"1996","unstructured":"D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic Publishers, Dordrecht, 1996)."},{"issue":"1","key":"327427_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/PROC.1987.13702","volume":"75","author":"J. Jubin","year":"1987","unstructured":"J. Jubin and J.D. Tornow, The DARPA packet radio network protocols, Proceedings of the IEEE 75(1) (1987) 21-32.","journal-title":"Proceedings of the IEEE"},{"key":"327427_CR15","doi-asserted-by":"crossref","unstructured":"S. Kutten and D. Peleg, Fast distributed construction of k-dominating sets and applications, in: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing(1995) pp. 238-249.","DOI":"10.1145\/224964.224990"},{"issue":"5","key":"327427_CR16","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, J. ACM 41(5) (1994) 960-981.","journal-title":"J. ACM"},{"issue":"1","key":"327427_CR17","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1145\/190809.190336","volume":"24","author":"C.E. Perkins","year":"1994","unstructured":"C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, Computer Communications Review 24(1) (1994) 234-244.","journal-title":"Computer Communications Review"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019045801829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019045801829\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019045801829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T21:55:39Z","timestamp":1752357339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019045801829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["327427"],"URL":"https:\/\/doi.org\/10.1023\/a:1019045801829","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}