Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
  Minimizing Flow Time in the Wireless Gathering Problem

Bonifaci, V., Korteweg, P., Marchetti-Spaccamela, A., & Stougie, L. (2011). Minimizing Flow Time in the Wireless Gathering Problem. ACM Transactions on Algorithms, 7(3): 33, pp. 33:1-33:20. doi:10.1145/1978782.1978788.

Item is

Dateien

einblenden: Dateien
ausblenden: Dateien
:
gathering-talg.pdf (beliebiger Volltext), 279KB
 
Datei-Permalink:
-
Name:
gathering-talg.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
© ACM, 2011. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM TRANSACTIONS ON ALGORITHMS, {7, 3, July 2011} http://doi.acm.org/10.1145/1978782.1978788
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Bonifaci, Vincenzo1, Autor           
Korteweg, Peter2, Autor
Marchetti-Spaccamela, Alberto2, Autor
Stougie, Leen2, Autor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We address the problem of efficient data gathering in a wireless network through multihop communication. We focus on two objectives related to flow times, that is, the times spent by data packets in the system: minimization of the maximum flow time and minimization of the average flow time of the packets. For both problems we prove that, unless P=NP, no polynomial-time algorithm can approximate the optimal solution within a factor less than $\Omega(m^{1-\epsilon})$ for any $0<\epsilon<1$, where $m$ is the number of packets. We then assess the performance of two natural algorithms by proving that their cost remains within the optimal cost of the respective problem if we allow the algorithms to transmit data at a speed 5 times higher than that of the optimal solutions to which we compare them.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 20112011
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 618715
DOI: 10.1145/1978782.1978788
URI: http://doi.acm.org/10.1145/1978782.1978788
Anderer: Local-ID: C1256428004B93B8-AE0CC65BAC8BF1D3C1257979005FB068-Bonifaci:2011:b
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: ACM Transactions on Algorithms
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: New York, NY : ACM
Seiten: - Band / Heft: 7 (3) Artikelnummer: 33 Start- / Endseite: 33:1 - 33:20 Identifikator: ISSN: 1549-6325