{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:13:04Z","timestamp":1725574384926},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207450"},{"type":"electronic","value":"9783540246046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24604-6_25","type":"book-chapter","created":{"date-parts":[[2011,1,6]],"date-time":"2011-01-06T22:39:36Z","timestamp":1294353576000},"page":"255-264","source":"Crossref","is-referenced-by-count":3,"title":["Various Distributed Shortest Path Routing Strategies for Wireless Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Subhankar","family":"Dhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael Q.","family":"Rieck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sukesh","family":"Pai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eun Jik","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P., Frieder, O.: New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks. In: Proceedings of 35th Hawaii International Conference on System Sciences, Hawaii (2002)","DOI":"10.1109\/HICSS.2002.994519"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets. In: IEEE International Conference on Communications (ICC 1997), pp. 376\u2013380 (1997)","DOI":"10.1109\/ICC.1997.605303"},{"key":"25_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-24596-4_15","volume-title":"High Performance Computing - HiPC 2003","author":"S. Dhar","year":"2003","unstructured":"Dhar, S., Rieck, M.Q., Pai, S.: On Shortest Path Routing Schemes for Wireless Ad-Hoc Networks. In: Pinkston, T.M., Prasanna, V.K. (eds.) HiPC 2003. LNCS (LNAI), vol.\u00a02913, pp. 130\u2013141. Springer, Heidelberg (2003)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica\u00a020 (1998)","DOI":"10.1007\/PL00009201"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"Johnson, D.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR6","unstructured":"Jia, L., Rajaraman, R., Suel, T.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, August 2001, pp. 33\u201342 (2001)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lovasz","year":"1975","unstructured":"Lovasz, L.: On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Liang, B., Haas, Z.J.: Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management. In: Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. INFOCOM, vol.\u00a03, pp. 1293\u20131302 (2000)","DOI":"10.1109\/INFCOM.2000.832522"},{"key":"25_CR9","unstructured":"Rampone, S.: Probability-driven Greedy Algorithms for Set Cover. VIII SIGEF Congress New Logics for the New Economy, Naples (September 2001)"},{"key":"25_CR10","unstructured":"Rieck, M.Q., Pai, S., Dhar, S.: Distributed Routing Algorithms for Wireless Ad Hoc Networks Using d-hop Connected d-hop Dominating Sets. In: Proceedings of the 6th International Conference on High Performance Computing: Asia Pacific (HPC Asia 2002) (December 2002)"},{"key":"25_CR11","first-page":"63","volume":"3","author":"J. Wu","year":"2001","unstructured":"Wu, J., Li, H.: A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks. Special issue on Wireless Networks in the Telecommunication Systems Journal\u00a03, 63\u201384 (2001)","journal-title":"Special issue on Wireless Networks in the Telecommunication Systems Journal"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing - IWDC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24604-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T04:09:16Z","timestamp":1553314156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24604-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207450","9783540246046"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24604-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}