Article ID: | iaor200924643 |
Country: | United States |
Volume: | 18 |
Issue: | 4 |
Start Page Number: | 422 |
End Page Number: | 432 |
Publication Date: | Oct 2006 |
Journal: | INFORMS Journal On Computing |
Authors: | Bollapragada Ramesh, Li Yanjun, Rao Uday S |
Keywords: | heuristics, location |
This paper presents a quantitative model for telecommunication network installation by companies in the broadband–access business, specialized to the fixed–wireless case. Under stochastic demand modeled using scenarios, we maximize the expected demand coverage subject to a budget constraint on hub installation, and technological constraints on demand coverage by installed hubs. There are multiple hub types, differing in costs and capacities. We present a practical greedy heuristic based on the budgeted maximum–coverage problem and analyze its worst–case performance. For special cases with a single hub type or a single demand scenario, we show that a guarantee of 1 − 1/