{"publication_status":"published","doi":"10.1007/978-3-540-30140-0_9","abstract":[{"lang":"eng","text":"Given n distinct points p1, p2, ... , pn in the plane, the map labeling\r\nproblem with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn\r\nof maximum possible size such that pi is a corner of Qi and no two squares overlap.\r\nThis problem is NP-hard and no algorithm with approximation ratio better\r\nthan 1/2 exists unless P = NP [10].\r\nIn this paper, we consider a scenario where we want to visualize the information\r\ngathered by smart dust, i.e. by a large set of simple devices, each consisting of\r\na sensor and a sender that can gather sensor data and send it to a central station.\r\nOur task is to label (the positions of) these sensors in a way described by the\r\nlabeling problem above. Since these devices are not positioned accurately (for\r\nexample, they might be dropped from an airplane), this gives rise to consider the\r\nmap labeling problem under the assumption, that the positions of the points are\r\nnot fixed precisely, but perturbed by random noise. In other words, we consider\r\nthe smoothed complexity of the map labeling problem. We present an algorithm\r\nthat, under such an assumption and Gaussian random noise with sufficiently large\r\nvariance, has linear smoothed complexity."}],"date_created":"2020-04-08T11:07:57Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","type":"conference","date_updated":"2022-01-06T06:52:50Z","publication":"12th Annual European Symposium on Algorithms (ESA 2004)","status":"public","intvolume":"      3221","year":"2004","place":"Berlin, Heidelberg","author":[{"last_name":"Bansal","full_name":"Bansal, Vikas","first_name":"Vikas"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"title":"Labeling Smart Dust","_id":"16474","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540230250","9783540301400"]},"department":[{"_id":"63"}],"volume":3221,"user_id":"15415","citation":{"apa":"Bansal, V., Meyer auf der Heide, F., &#38; Sohler, C. (2004). Labeling Smart Dust. In <i>12th Annual European Symposium on Algorithms (ESA 2004)</i> (Vol. 3221). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">https://doi.org/10.1007/978-3-540-30140-0_9</a>","ieee":"V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, 2004, vol. 3221.","mla":"Bansal, Vikas, et al. “Labeling Smart Dust.” <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, vol. 3221, 2004, doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>.","ama":"Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>. Vol 3221. Lecture Notes in Computer Science. Berlin, Heidelberg; 2004. doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>","short":"V. Bansal, F. Meyer auf der Heide, C. Sohler, in: 12th Annual European Symposium on Algorithms (ESA 2004), Berlin, Heidelberg, 2004.","chicago":"Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling Smart Dust.” In <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">https://doi.org/10.1007/978-3-540-30140-0_9</a>.","bibtex":"@inproceedings{Bansal_Meyer auf der Heide_Sohler_2004, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Labeling Smart Dust}, volume={3221}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-30140-0_9\">10.1007/978-3-540-30140-0_9</a>}, booktitle={12th Annual European Symposium on Algorithms (ESA 2004)}, author={Bansal, Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2004}, collection={Lecture Notes in Computer Science} }"}}