Sterbenz,
J. P.
,
Cetinkaya,
E. K.
,
Hameed,
M. A.
,
Jabbar,
A.
,
Qian,
S.
, and
Rohrer,
J. P.
, 2013, “
Evaluation of Network Resilience, Survivability, and Disruption Tolerance: Analysis, Topology Generation, Simulation, and Experimentation,” Telecommun. Syst.,
52(2), pp. 705–736.

Konak,
A.
, and
Bartolacci,
M. R.
, 2007, “
Designing Survivable Resilient Networks: A Stochastic Hybrid Genetic Algorithm Approach,” Omega,
35(6), pp. 645–658.

[CrossRef]
Kwak,
N.
, and
Lee,
C.
, 1998, “
A Multicriteria Decision-Making Approach to University Resource Allocations and Information Infrastructure Planning,” Eur. J. Oper. Res.,
110(2), pp. 234–242.

[CrossRef]
Gutiérrez,
J.
,
Monzon,
A.
, and
Piñero,
J.
, 1998, “
Accessibility, Network Efficiency, and Transport Infrastructure Planning,” Environ. Plann. A,
30(8), pp. 1337–1350.

[CrossRef]
Mainwaring,
A.
,
Culler,
D.
,
Polastre,
J.
,
Szewczyk,
R.
, and
Anderson,
J.
, 2002, “
Wireless Sensor Networks for Habitat Monitoring,” 1st ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, GA, Sept. 28, pp. 88–97.

Cerpa,
A.
,
Elson,
J.
,
Estrin,
D.
,
Girod,
L.
,
Hamilton,
M.
, and
Zhao,
J.
, 2001, “
Habitat Monitoring: Application Driver for Wireless Communications Technology,” ACM SIGCOMM Comput. Commun. Rev.,
31(Suppl. 2), pp. 20–41.

[CrossRef]
Anussornnitisarn,
P.
,
Nof,
S. Y.
, and
Etzion,
O.
, 2005, “
Decentralized Control of Cooperative and Autonomous Agents for Solving the Distributed Resource Allocation Problem,” Int. J. Prod. Econ.,
98(2), pp. 114–128.

[CrossRef]
Mathew,
G.
, and
Surana,
A.
, 2012, “
A Static Coverage Algorithm for Locational Optimization,” 51st Annual Conference on Decision and Control (CDC), Maui, HI, Dec. 10–13, pp. 806–811.

Berry,
J.
,
Hart,
W. E.
,
Phillips,
C. A.
,
Uber,
J. G.
, and
Watson,
J.-P.
, 2006, “
Sensor Placement in Municipal Water Networks With Temporal Integer Programming Models,” J. Water Resour. Plann. Manage.,
132(4), pp. 218–224.

[CrossRef]
Mirchandani,
P. B.
, and
Francis,
R. L.
, 1990, Discrete Location Theory,
Wiley,
New York.

Krause,
A.
,
Singh,
A.
, and
Guestrin,
C.
, 2008, “
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies,” J. Mach. Learn. Res.,
9, pp. 235–284.

Okabe,
A.
, and
Suzuki,
A.
, 1997, “
Locational Optimization Problems Solved Through Voronoi Diagrams,” Eur. J. Oper. Res.,
98(3), pp. 445–456.

[CrossRef]
Guruprasad,
K.
, and
Ghose,
D.
, 2009, “
Coverage Optimization Using Generalized Voronoi Partition,” e-print arXiv:0908.3565.

Cortes,
J.
,
Martinez,
S.
,
Karatas,
T.
, and
Bullo,
F.
, 2004, “
Coverage Control for Mobile Sensing Networks,” IEEE Trans. Rob. Autom.,
20(2), pp. 243–255.

[CrossRef]
Lloyd,
S.
, 1982, “
Least Squares Quantization in PCM,” IEEE Trans. Inf. Theory,
28(2), pp. 129–137.

[CrossRef]
Oliveto,
P. S.
,
He,
J.
, and
Yao,
X.
, 2007, “
Time Complexity of Evolutionary Algorithms for Combinatorial Optimization: A Decade of Results,” Int. J. Autom. Comput.,
4(3), pp. 281–293.

[CrossRef]
Sudholt,
D.
, 2008, “
Computational Complexity of Evolutionary Algorithms, Hybridizations, and Swarm Intelligence,” Ph.D. thesis, Dortmund University of Technology, Dortmund, Germany.

MacKay,
D. J.
, 2003, Information Theory, Inference, and Learning Algorithms, Vol.
7,
Cambridge University Press,
Cambridge, UK.

Hartigan,
J. A.
, and
Wong,
M. A.
, 1979, “
Algorithm as 136: A K-Means Clustering Algorithm,” J. R. Stat. Soc. Ser. C,
28(1), pp. 100–108.

Kanungo,
T.
,
Mount,
D. M.
,
Netanyahu,
N. S.
,
Piatko,
C. D.
,
Silverman,
R.
, and
Wu,
A. Y.
, 2002, “
An Efficient K-Means Clustering Algorithm: Analysis and Implementation,” IEEE Trans. Pattern Anal. Mach. Intell.,
24(7), pp. 881–892.

[CrossRef]
Aurenhammer,
F.
, 1991, “
Voronoi Diagrams—A Survey of a Fundamental Geometric Data Structure,” ACM Comput. Surv.,
23(3), pp. 345–405.

[CrossRef]
Cheng,
S.-W.
,
Dey,
T. K.
, and
Shewchuk,
J.
, 2012, Delaunay Mesh Generation,
CRC Press,
Boca Raton, FL.

Cheng,
S.-W.
,
Dey,
T. K.
,
Ramos,
E. A.
, and
Ray,
T.
, 2007, “
Sampling and Meshing a Surface With Guaranteed Topology and Geometry,” SIAM J. Comput.,
37(4), pp. 1199–1227.

[CrossRef]
Stein,
M. L.
, 1999, Interpolation of Spatial Data: Some Theory for Kriging,
Springer,
New York.

Oliver,
M. A.
, and
Webster,
R.
, 1990, “
Kriging: A Method of Interpolation for Geographical Information Systems,” Int. J. Geogr. Inf. Syst.,
4(3), pp. 313–332.

[CrossRef]
Lophaven,
S. N.
,
Nielsen,
H. B.
, and
Søndergaard,
J.
, 2002, “
DACE—A matlab Kriging Toolbox, Version 2.0,” Technical University of Denmark, Lyngby, Denmark, Technical Report No. IMM-TR-2002-12.

Catina,
E.
, 2005, “
The Inexact, Inexact Perturbed, and Quasi-Newton Methods are Equivalent Models,” Math. Comput.,
74(249), pp. 291–301.

[CrossRef]
Kriegel,
H.-P.
,
Kröger,
P.
,
Sander,
J.
, and
Zimek,
A.
, 2011, “
Density-Based Clustering,” Wiley Interdiscip. Rev.,
1(3), pp. 231–240.

Xu,
R.
, and
Wunsch,
D.
, 2005, “
Survey of Clustering Algorithms,” IEEE Trans. Neural Networks,
16(3), pp. 645–678.

[CrossRef]