A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

Autor: Nieberg, T., Hurink, Johann L., Kern, Walter, Hromkovič, Juraj, Nagel, Manfred, Westfechtel, Bernhard

Publikováno v: Graph-Theoretic Concepts in Computer Science ISBN: 9783540241324
WG
Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, 214-221
STARTPAGE=214;ENDPAGE=221;TITLE=Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004

A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem in unit disk graphs. In contrast to previously known approximation sche

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c775d36e18d02e44e6c97fabd1b255ad
https://doi.org/10.1007/978-3-540-30559-0_18

A Distributed and Self-Organizing Scheduling Algorithm for Energy-Efficient Data Aggregation in Wireless Sensor Networks

Autor: Chatterjea, Supriyo, Nieberg, T., Meratnia, Nirvana, Havinga, Paul J.M.

Wireless sensor networks (WSNs) are increasingly being used to monitor various parameters in a wide range of environmental monitoring applications. In many instances, environmental scientists are interested in collecting raw data using long-running q

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::dd7bfbbe8b93673876e37db5c6e4034c
https://research.utwente.nl/en/publications/a-distributed-and-selforganizing-scheduling-algorithm-for-energyefficient-data-aggregation-in-wireless-sensor-networks(f0a9a314-b72f-45cb-914b-43e1f39bafb3).html

Independent and Dominating Sets in Wireless Communication Graphs

Autor: Nieberg, T.

Wireless ad hoc networks are advancing rapidly, both in research and more and more into our everyday lives. Wireless sensor networks are a prime example of a new technology that has gained a lot of attention in the literature, and that is going to en

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::8dfd851caf0e92e15af66e3649b5c044
https://research.utwente.nl/en/publications/independent-and-dominating-sets-in-wireless-communication-graphs(80e237b5-a1a8-4c54-a022-8b91002d4318).html

Clustersize control and cluster based routing in Wireless Sensor Networks

Autor: Havinga, Paul J.M., Nieberg, T., Hurink, Johann L.

Publikováno v: ICT 2005-Proceedings of the 12th International Conference on Telecommunications, Capetown, South Africa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::abf49fdb23db0af4f1d9de1c0945ad87
https://research.utwente.nl/en/publications/clustersize-control-and-cluster-based-routing-in-wireless-sensor-networks(e8e9ff74-facf-4a3c-ab83-99b7bb16b379).html

Wireless communication graphs

Autor: Nieberg, T., Hurink, Johann L., Palaniswami, M, Krishnamachari, B., Sowmya, A., Challa, S.

Publikováno v: STARTPAGE=367;ENDPAGE=372;TITLE=ISSNIP 2004

We consider graph models which represent communication in wireless ad-hoc networks. In such networks, each node equipped with a radio has a certain transmission range, and all surrounding nodes in this range can receive a transmission. In ideal setti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a24a28fc911146e3477d417eba3a91c3
https://research.utwente.nl/en/publications/8af563d0-99fc-4cd6-b157-74f5b8ffaebf