The Wireless Gathering Problem is to find an interference-free schedule for data gathering in a wireless network in minimum time. We present a 4-approximate polynomial-time on-line algorithm for this NP-hard problem. We show that no shortest path following algorithm can have an approximation ratio better than 4. © 2008 Elsevier B.V. All rights reserved.
Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., & Stougie, L. (2008). An approximation algorithm for the wireless gathering problem. OPERATIONS RESEARCH LETTERS, 36(5), 605-608.
Titolo: | An approximation algorithm for the wireless gathering problem |
Autori: | |
Data di pubblicazione: | 2008 |
Rivista: | |
Citazione: | Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., & Stougie, L. (2008). An approximation algorithm for the wireless gathering problem. OPERATIONS RESEARCH LETTERS, 36(5), 605-608. |
Handle: | http://hdl.handle.net/11590/380498 |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.