{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:21:38Z","timestamp":1743060098378,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034169"},{"type":"electronic","value":"9783642034176"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03417-6_15","type":"book-chapter","created":{"date-parts":[[2009,8,5]],"date-time":"2009-08-05T03:57:54Z","timestamp":1249444674000},"page":"149-158","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Interference Planar Geometric Topology in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Trac N.","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Dung T.","family":"Huynh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Proietti, G.: On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. Theorectical Computer Science\u00a0402, 43\u201355 (2008)","DOI":"10.1016\/j.tcs.2008.03.004"},{"key":"15_CR2","unstructured":"Buchin, K.: Minimizing the Maximum Interference is Hard (2008), http:\/\/arxiv.org\/abs\/0802.2134"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does Topology Control Reduce Interference? In: MOBIHOC 2004, pp. 9\u201319 (2004)","DOI":"10.1145\/989459.989462"},{"issue":"34","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"6","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput.\u00a06(34), 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/978-3-540-78773-0_64","volume-title":"LATIN 2008: Theoretical Informatics","author":"T. Erlebach","year":"2008","unstructured":"Erlebach, T., van Leeuwen, E.J.: Domination in Geometric Intersection Graphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 747\u2013758. Springer, Heidelberg (2008)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11963271_7","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"M.M. Halld\u00f3rsson","year":"2006","unstructured":"Halld\u00f3rsson, M.M., Tokuyama, T.: Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2006. LNCS, vol.\u00a04240, pp. 71\u201382. Springer, Heidelberg (2006)"},{"issue":"26","key":"15_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"2","author":"D.B. Hunt III","year":"1998","unstructured":"Hunt III, D.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC- Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. Journal Algorithms\u00a02(26), 238\u2013274 (1998)","journal-title":"Journal Algorithms"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Johansson, T., Carr-Motyckova\u00e1, L.: Reducing Interference in Ad Hoc Networks Through Topology Control. In: DIALM-POMC 2005, pp. 17\u201323 (2005)","DOI":"10.1145\/1080810.1080815"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Lichtenstein, D.: Planar Formulae And Their Uses. SIAM J. of Compt.\u00a011(23) (1982)","DOI":"10.1137\/0211025"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11847250_14","volume-title":"Parameterized and Exact Computation","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized Complexity of Independence and Domination on Geometric Graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 154\u2013165. Springer, Heidelberg (2006)"},{"key":"15_CR11","first-page":"41","volume":"1","author":"K. Moaveni-Nejad","year":"2005","unstructured":"Moaveni-Nejad, K., Li, X.-Y.: Low-Interference Topology Control for Wireless Ad Hoc Networks. Ad Hoc and Wireless Sensor Networks\u00a01, 41\u201364 (2005)","journal-title":"Ad Hoc and Wireless Sensor Networks"},{"key":"15_CR12","unstructured":"Rickenbach, P.V., Schmid, S., Wattenhofer, R., Zollinger, A.: A Roburst Interference Model for Wireless Ad-Hoc Networks. In: Proc. 19th IEEE Int. Par. and Dist. (2005)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"Valiant, L.: Universality Considerations in VLSI Circuits. IEEE Trans. on Compupters\u00a0C-30, 135\u2013140 (1981)","journal-title":"IEEE Trans. on Compupters"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/11785293_30","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"E.J. Leeuwen van","year":"2006","unstructured":"van Leeuwen, E.J.: Better Approximation Schemes for Disk Graphs. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 316\u2013327. Springer, Heidelberg (2006)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1504\/IJSNET.2007.014357","volume":"2","author":"K.-D. Wu","year":"2007","unstructured":"Wu, K.-D., Liao, W.: On Constructing Low Interference Topology in Multihop Wireless Networks. Int. J. of Sensor Networks\u00a02, 321\u2013330 (2007)","journal-title":"Int. J. of Sensor Networks"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03417-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T17:24:41Z","timestamp":1558459481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03417-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034169","9783642034176"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03417-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}