{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:27:38Z","timestamp":1740202058837,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135613"},{"type":"electronic","value":"9783642135620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13562-0_18","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T09:08:30Z","timestamp":1275296910000},"page":"187-198","source":"Crossref","is-referenced-by-count":0,"title":["Centdian Computation for Sensor Networks"],"prefix":"10.1007","author":[{"given":"Boaz","family":"Ben-Moshe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Dvir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: Annual ACM Symposium on Theory of Computing, New York, USA, July 1987, pp. 230\u2013240 (1987)","DOI":"10.1145\/28395.28421"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.tcs.2007.02.033","volume":"378","author":"B. Ben-Moshe","year":"2007","unstructured":"Ben-Moshe, B., Bhattacharya, B.K., Shi, Q., Tamir, A.: Efficient algorithms for center problems in cactus networks. Theoretical Computer Science\u00a0378(3), 237\u2013252 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF02684332","volume":"60","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., Krarup, J.: A linear algorithm for the pos\/neg-weighted 1-median problem on cactus. Computing\u00a060(3), 498\u2013509 (1998)","journal-title":"Computing"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/net.3230150402","volume":"15","author":"M.L. Chen","year":"1986","unstructured":"Chen, M.L., Francis, R.L., Lawrence, J.F., Lowe, T.J., Tufekci, S.: Block-vertex duality and the 1-median problem. Networks\u00a015(4), 395\u2013412 (1986)","journal-title":"Networks"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1287\/trsc.22.4.259","volume":"22","author":"M.L. Chen","year":"1988","unstructured":"Chen, M.L., Francis, R.L., Lowe, T.J.: The 1-center problem: Exploiting block structure. Transport Science\u00a022, 259\u2013269 (1988)","journal-title":"Transport Science"},{"issue":"1","key":"18_CR6","first-page":"121","volume":"10","author":"K. Das","year":"2008","unstructured":"Das, K., Pal, M.: An optimal algorithm to find maximum and minimum height spanning trees on cactus graphs. Advanced Modeling and Optimization\u00a010(1), 121\u2013134 (2008)","journal-title":"Advanced Modeling and Optimization"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Deb, B., Nath, B.: On the node-scheduling approach to topology control in ad hoc networks. In: ACM MOBIHOC, pp. 14\u201326 (2005)","DOI":"10.1145\/1062689.1062693"},{"issue":"1-2","key":"18_CR8","first-page":"123","volume":"6","author":"A. Dvir","year":"2008","unstructured":"Dvir, A., Segal, M.: The (k,l)-coredian tree for ad hoc networks. Journal of Ad Hoc and Sensor Wireless Networks\u00a06(1-2), 123\u2013144 (2008)","journal-title":"Journal of Ad Hoc and Sensor Wireless Networks"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Dvir, A., Segal, M.: Placing and maintaining a core node in wireless ad hoc sensor networks. Wireless Communications and Mobile Computing (2009) (to appear)","DOI":"10.1002\/wcm.795"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"ElBatt, T.A., Ephremides, A.: Joint scheduling and power control for wireless ad-hoc networks. In: IEEE INFOCOM, pp. 976\u2013984 (2002)","DOI":"10.1109\/INFCOM.2002.1019345"},{"key":"18_CR11","unstructured":"Ergen, M.: WTRP - wireless token ring protocol. M.sc. thesis, Electrical Engineering and Computer Science, Berkeley, California, USA (2002)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/mnsc.24.5.535","volume":"24","author":"J. Halpern","year":"1978","unstructured":"Halpern, J.: Finding minimal center-median convex combination (cent-dian) of a graph. Management Science\u00a024, 534\u2013544 (1978)","journal-title":"Management Science"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00607-007-0238-y","volume":"80","author":"H. Hatzl","year":"2007","unstructured":"Hatzl, H.: Median problems on wheels and cactus graphs. Computing\u00a080(4), 377\u2013393 (2007)","journal-title":"Computing"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0305-0548(90)90008-U","volume":"17","author":"R.K. Kincaid","year":"1990","unstructured":"Kincaid, R.K., Maimon, O.Z.: A note on locating a central vertex of a 3-cactus graph. Computers and Operations Research\u00a017(3), 315\u2013320 (1990)","journal-title":"Computers and Operations Research"},{"key":"18_CR15","volume-title":"Algorithmische Geometrie","author":"R. Klein","year":"1996","unstructured":"Klein, R.: Algorithmische Geometrie. Addison Wesley, Reading (1996)"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0377-2217(99)00080-6","volume":"122","author":"Y.F. Lan","year":"2000","unstructured":"Lan, Y.F., Wang, Y.L.: An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs. European Journal of Operational Research\u00a0122(3), 602\u2013610 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"18_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(99)00111-8","volume":"71","author":"Y.F. Lan","year":"1999","unstructured":"Lan, Y.F., Wang, Y.L., Suzuki, H.: A linear-time algorithm for solving the center problem on weighted cactus graphs. Information Processing Letters\u00a071(5), 205\u2013212 (1999)","journal-title":"Information Processing Letters"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Lee, D., Puri, A., Varaiya, P., Attias, R., Sengupta, R., Tripakis, S.: A wireless token ring protocol for ad-hoc networks. In: IEEE Aerospace Conference, Montana, USA (2002)","DOI":"10.1109\/AERO.2002.1035254"},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11276-004-4753-x","volume":"11","author":"H. Luo","year":"2005","unstructured":"Luo, H., Ye, F., Cheng, J., Lu, S., Zhang, L.: TTDD: Two-tier data dissemination in large-scale wireless sensor networks. Wireless Networks\u00a011(1), 161\u2013175 (2005)","journal-title":"Wireless Networks"},{"key":"18_CR20","volume-title":"Davenport-Schinzel Sequences and their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"key":"18_CR21","unstructured":"Soochang, P., Bongsoo, K., Euisin, L., Donghun, L., Younghwan, C., Sang-Ha, K.: A novel communication architecture to support mobile users in wireless sensor fields. In: IEEE Vehicular Technology Conference, Dublin, Ireland, April 2007, pp. 66\u201370 (2007)"},{"key":"18_CR22","unstructured":"Tamir, A., Puerto, J., Perez-Brito, D., Rodriguez-Chia, A.M.: The pareto set for the doubly weighted center-median path problem on a tree. In: The Institute for Operations Research and the Management Sciences, September 2005, pp. 1\u201328 (2005)"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Wang, H., Kong, P.-Y., Guan, W.S.K.: A robust and energy efficient routing scheme for wireless sensor networks. In: International Conference Workshops on Distributed Computing Systems, DC, USA, July 2006, pp. 83\u201389 (2006)","DOI":"10.1109\/ICDCSW.2006.10"},{"issue":"3","key":"18_CR24","first-page":"251","volume":"6","author":"J.E. Wieselthier","year":"2001","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Algorithms for energy-effcient multicasting in static ad hoc wireless networks. ACM MONET\u00a06(3), 251\u2013263 (2001)","journal-title":"ACM MONET"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Xianpu, S., Yanling, Z., Jiandong, L.: Wireless dynamic token protocol for MANET. In: Parallel Processing Workshops, Xian, China, September 2007, pp. 1\u20135 (2007)","DOI":"10.1109\/ICPPW.2007.82"},{"issue":"12","key":"18_CR26","doi-asserted-by":"publisher","first-page":"2292","DOI":"10.1016\/j.comnet.2008.04.002","volume":"52","author":"J. Yicka","year":"2008","unstructured":"Yicka, J., Mukherjeea, B., Ghosal, D.: Wireless sensor network survey. Computer Networks\u00a052(12), 2292\u20132330 (2008)","journal-title":"Computer Networks"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Zmazek, B., Zerovnik, J.I.: Estimating the traffic on weighted cactus networks in linear time. In: International Conference on Information Visualisation, London, UK, July 2005, pp. 536\u2013541 (2005)","DOI":"10.1109\/IV.2005.48"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13562-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:20:02Z","timestamp":1740136802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13562-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135613","9783642135620"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13562-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}