Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink
From MaRDI portal
Publication:5274521
DOI10.1109/TC.2012.124zbMath1365.68470MaRDI QIDQ5274521
Pascal Schweitzer, Zichuan Xu, Weifa Liang
Publication date: 12 July 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
New approximation algorithms for the rooted budgeted cycle cover problem ⋮ New approximation algorithms for the rooted budgeted cycle cover problem
This page was built for publication: Approximation Algorithms for Capacitated Minimum Forest Problems in Wireless Sensor Networks with a Mobile Sink