{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:17Z","timestamp":1725638237394},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_10","type":"book-chapter","created":{"date-parts":[[2011,12,2]],"date-time":"2011-12-02T19:32:34Z","timestamp":1322854354000},"page":"80-89","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius"],"prefix":"10.1007","author":[{"given":"Matias","family":"Korman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"P. Agarwal","year":"1991","unstructured":"Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom.\u00a06, 407\u2013422 (1991)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.comgeo.2007.06.004","volume":"40","author":"M. Benkert","year":"2008","unstructured":"Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing minimum-interference networks. Comput. Geom. Theory Appl.\u00a040(3), 179\u2013194 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2008.03.004","volume":"402","author":"D. Bil\u00f2","year":"2008","unstructured":"Bil\u00f2, D., Proietti, G.: On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci.\u00a0402(1), 43\u201355 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR4","unstructured":"Buchin, K.: Minimizing the maximum interference is hard. CoRR, abs\/0802.2134 (2008)"},{"key":"10_CR5","first-page":"226","volume-title":"Proceedings of the 24th Annual Symposium on Foundations of Computer Science","author":"K.L. Clarkson","year":"1983","unstructured":"Clarkson, K.L.: Fast algorithms for the all nearest neighbors problem. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pp. 226\u2013232. IEEE Computer Society, Washington, DC (1983)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Fussen, M., Wattenhofer, R., Zollinger, A.: Interference arises at the receiver. In: In Proceedings of Int. Conference on Wireless Networks, Communications, and Mobile Computing, WIRELESSCOM (2005)","DOI":"10.1109\/WIRLES.2005.1549447"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2008.03.003","volume":"402","author":"M. Halld\u00f3rsson","year":"2008","unstructured":"Halld\u00f3rsson, M., Tokuyama, T.: Minimizing interference of a wireless ad-hoc network in a plane. Theor. Comput. Sci.\u00a0402(1), 29\u201342 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Korman, M.: Minimizing interference in ad-hoc networks with bounded communication radius. CoRR, abs\/1102.2785 (2011)","DOI":"10.1007\/978-3-642-25591-5_10"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-55719-9_93","volume-title":"Automata, Languages and Programming","author":"M. Paterson","year":"1992","unstructured":"Paterson, M., Yao, F.F.: On Nearest-Neighbor Graphs. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 416\u2013426. Springer, Heidelberg (1992)"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/1089733.1089736","volume":"37","author":"P. Santi","year":"2005","unstructured":"Santi, P.: Topology control in wireless ad hoc and sensor networks. ACM Comput. Surv.\u00a037(2), 164\u2013194 (2005)","journal-title":"ACM Comput. Surv."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P.M. Vaidya","year":"1989","unstructured":"Vaidya, P.M.: An O(n logn) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom.\u00a04, 101\u2013115 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TNET.2008.926506","volume":"17","author":"P. Rickenbach von","year":"2009","unstructured":"von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE\/ACM Trans. Netw.\u00a017(1), 172\u2013185 (2009)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T02:11:41Z","timestamp":1560996701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}