On a Class of Covering Problems with Variable Capacities in Wireless Networks
From MaRDI portal
Publication:5746253
DOI10.1007/978-3-319-04657-0_15zbMath1407.68344OpenAlexW2177301931MaRDI QIDQ5746253
Daya Ram Gaur, Mark Thom, Shahadat Hossain, Selim G. Akl, Robert Benkoczi, Hossam S. Hassanein
Publication date: 18 February 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1974/14033
Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)
This page was built for publication: On a Class of Covering Problems with Variable Capacities in Wireless Networks
