Zobrazeno 1 - 10 of 53 pro vyhledávání: '"Nieberg, T."'
1
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Autor: Kuhn, Fabian, Moscibroda, Thomas, Nieberg, T., Wattenhofer, Roger, Fraigniaud, Pierre
Publikováno v: Distributed Computing: 19th International Conference, DISC 2005, 273-283
STARTPAGE=273;ENDPAGE=283;TITLE=Distributed Computing: 19th International Conference, DISC 2005
Lecture Notes in Computer Science ISBN: 9783540291633
DISC
The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm for general graphs, no deterministic polylogarithmic algori
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::719356b4df5fd1dfeb531dbfe84f6577
https://doi.org/10.1007/11561927_21
Zobrazit plný text záznamu
2
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
Zobrazit plný text záznamu
5
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
Zobrazit plný text záznamu
6
Local Approximation Schemes for Ad Hoc and Sensor Networks
Autor: Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R., Banerjee, S, Ganguly, S.
Publikováno v: 2005 Joint Workshop on Foundations of Mobile Computing, 91-106
STARTPAGE=91;ENDPAGE=106;TITLE=2005 Joint Workshop on Foundations of Mobile Computing
DIALM-POMC
We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1+ε)-approximation
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fec62ff99a3613b897e5875238c3f5cb
https://research.utwente.nl/en/publications/0749bfd6-173c-4a0d-a902-16daadecc64a
Zobrazit plný text záznamu
9
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
Zobrazit plný text záznamu
10
Multipath Routing with Erasure Coding for Wireless Sensor Networks
Autor: Wu Jian, W.J., Dulman, S.O., Havinga, Paul J.M., Nieberg, T.
Publikováno v: ISSUE=15;STARTPAGE=181;ENDPAGE=188;TITLE=15th Annual Workshop on Circuits, Systems and Signal Processing, ProRisc 2004
Multipath routing algorithm in wireless sensor networks (WSN) increase the reliability of the system at the cost of significantly increased traffic. This paper introduces a splitted multipath routing scheme to improve the reliability of data routing
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::8c1f2c2c9d718c4a442bc10c26f66046
https://research.utwente.nl/en/publications/multipath-routing-with-erasure-coding-for-wireless-sensor-networks(ee43ee75-d572-49c5-b876-6c3e653e930d).html
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje