Minimizing flow time in the wireless gathering problem

DOI10.1145/1978782.1978788zbMath1295.68040arXiv0802.2836OpenAlexW2148438817MaRDI QIDQ3189016

Vincenzo Bonifaci, Peter Korteweg, Leen Stougie, Alberto Marchetti-Spaccamela

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.2836

zbMATH Keywords

approximation algorithmswireless networkslocal algorithmsdata gathering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (5)

Induced matchings in strongly biconvex graphs and some algebraic applications ⋮ Maximum Induced Matchings in Grids ⋮ The distributed wireless gathering problem ⋮ Maximum induced matching algorithms via vertex ordering characterizations ⋮ Maximum Induced Matching Algorithms via Vertex Ordering Characterizations

This page was built for publication: Minimizing flow time in the wireless gathering problem