{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:25Z","timestamp":1760440465604},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_14","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T16:37:18Z","timestamp":1136479038000},"page":"166-176","source":"Crossref","is-referenced-by-count":7,"title":["Constructing Interference-Minimal Networks"],"prefix":"10.1007","author":[{"given":"Marc","family":"Benkert","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"given":"Herman","family":"Haverkort","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3\u20134","key":"14_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0925-7721(00)00022-5","volume":"17","author":"S. Arya","year":"2000","unstructured":"Arya, S., Mount, D.: Approximate Range Searching. Compututational Geometry: Theory & Applications\u00a017(3\u20134), 135\u2013152 (2000)","journal-title":"Compututational Geometry: Theory & Applications"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does Topology Control Reduce Interference? In: Proc. 5th ACM Int. Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 9\u201319 (2004)","DOI":"10.1145\/989459.989462"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields. Journal of the ACM\u00a042, 67\u201390 (1995)","journal-title":"Journal of the ACM"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/S0097539798349188","volume":"30","author":"T.M. Chan","year":"2000","unstructured":"Chan, T.M.: Random Sampling, Halfspace Range Reporting, and Construction of (\u2264k)-Levels in Three Dimensions. SIAM J. on Computing\u00a030(2), 561\u2013575 (2000)","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0925-7721(01)00027-X","volume":"23","author":"J. Gudmundsson","year":"2002","unstructured":"Gudmundsson, J., Hammar, M., van Kreveld, M.: Higher Order Delaunay Triangulations. Computational Geometry: Theory & Appl.\u00a023(1), 85\u201398 (2002)","journal-title":"Computational Geometry: Theory & Appl."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Narasimhan, G., Smid, M.: Distance-Preserving Approximations of Polygonal Paths. In: FST & TCS, pp. 217\u2013228 (2003)","DOI":"10.1007\/978-3-540-24597-1_19"},{"issue":"2-3","key":"14_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.comgeo.2004.03.004","volume":"28","author":"H.J. Haverkort","year":"2004","unstructured":"Haverkort, H.J., de Berg, M., Gudmundsson, J.: Box-Trees for Collision Checking in Industrial Installations. Computational Geometry: Theory & Applications\u00a028(2-3), 113\u2013135 (2004)","journal-title":"Computational Geometry: Theory & Applications"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TC.1982.1675946","volume":"31","author":"D.T. Lee","year":"1982","unstructured":"Lee, D.T.: On k-Nearest Neighbor Voronoi Diagrams in the Plane. IEEE Transactions on Computing\u00a031, 478\u2013487 (1982)","journal-title":"IEEE Transactions on Computing"},{"key":"14_CR9","unstructured":"Moaveni-Nejad, K., Li, X.-Y.: Low-Interference Topology Control for Wireless Ad Hoc Networks. Ad Hoc & Sensor Wireless Networks (2004) (Accepted for publ.)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range Searching with Efficient Hierarchical Cuttings. Discrete Computational Geometry\u00a010, 157\u2013182 (1993)","journal-title":"Discrete Computational Geometry"},{"issue":"6","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1137\/0216065","volume":"16","author":"A. Moffat","year":"1987","unstructured":"Moffat, A., Takaoka, T.: An All Pairs Shortest Path Algorithm with Expected Time O(n\n                           2 logn). SIAM Journal on Computing\u00a016(6), 1023\u20131031 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1137\/S0097539799361671","volume":"30","author":"G. Narasimhan","year":"2000","unstructured":"Narasimhan, G., Smid, M.: Approximating the Stretch Factor of Euclidean Graphs. SIAM Journal of Computing\u00a030(3), 978\u2013989 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Prakash, R.: Unidirectional Links Prove Costly in Wireless Ad-Hoc Networks. In: Proc. 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), pp. 15\u201322 (1999)","DOI":"10.1145\/313239.313263"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Prim, R.C.: Shortest Connection Networks and Some Generalisations. Bell Systems Technical Journal, 1389\u20131410 (1957)","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Ramos, E.A.: On Range Reporting, Ray Shooting and k-Level Construction. In: Proc. 15th Symp. on Computational Geometry, pp. 390\u2013399 (1999)","DOI":"10.1145\/304893.304993"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A Robust Interference Model for Wireless Ad-Hoc Networks. In: Proc. 5th Int. Worksh. Alg. for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), CD ROM (2005)","DOI":"10.1109\/IPDPS.2005.65"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:22Z","timestamp":1619507362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11611257_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}