A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access

We study a two-phase, budget-con strained, network-planning problem with multiple hub types and demand scenarios. In each phase, we install (or move) capacitated hubs on selected buildings. We allocate hubs to realized demands, under technological constraints. We present a greedy algorithm to maximize expected demand covered and computationally study its performance. (C) 2004 Elsevier B.V. All rights reserved.