Sciweavers

220 search results - page 20 / 44
» Primal-Dual Algorithms for Connected Facility Location Probl...
Sort
View
MP
1998
109views more  MP 1998»
14 years 11 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
WCNC
2008
IEEE
15 years 6 months ago
Connectivity-Aware Network Maintenance via Relays Deployment
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
14 years 9 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
GLOBECOM
2007
IEEE
15 years 6 months ago
Improving Connectivity via Relays Deployment in Wireless Sensor Networks
Abstract— Enhancing the connectivity of wireless sensor networks is necessary to avoid the occurrence of coverage gaps. In this paper, we aim at improving the network connectivit...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
GLOBECOM
2008
IEEE
15 years 6 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras