We consider clustering problems under two different optimization criteria. One is to minimize the maximum intracluster distance (diameter), and the other is to maximize the minimum interclusterâ€¦ (More)

Intrusion detection, area coverage and border surveillance are important applications of wireless sensor networks today. They can be (and are being) used to monitor large unprotected areas so as toâ€¦ (More)

Efficient algorithms for solving the center problems in weighted cactus networks are presented. In particular, we have proposed the following algorithms for the weighted cactus networks of size n: anâ€¦ (More)

In this paper, we provide efficient algorithms for solving the weighted center problems in a cactus graph. In particular, an O(n log n) time algorithm is proposed that finds the weighted 1-center inâ€¦ (More)

In this paper we investigate the location of mobile facilities (in <italic>L</italic><subscrpt>∞</subscrpt> and <italic>L</italic><subscrpt>2</subscrpt> metric) under the motion of clients. Inâ€¦ (More)