Sciweavers

103 search results - page 5 / 21
» The equitable location problem on the plane
Sort
View
CCCG
2008
14 years 11 months ago
Maximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
MP
1998
105views more  MP 1998»
14 years 9 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 4 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
WISEC
2010
ACM
15 years 3 months ago
Zeroing-in on network metric minima for sink location determination
The locations of base stations are critically important to the viability of wireless sensor networks. In this paper, we examine the location privacy problem from both the attack a...
Zhenhua Liu, Wenyuan Xu
ICDCS
2005
IEEE
15 years 3 months ago
Location Estimation in Ad Hoc Networks with Directional Antennas
With the development of location aware sensor applications, location determination has become an increasingly important middleware technology. Numerous current technologies for lo...
Nipoon Malhotra, Mark D. Krasniewski, Chin-Lung Ya...