Sciweavers

1760 search results - page 4 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 1 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
ICALP
2001
Springer
14 years 2 days ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
FGCN
2007
IEEE
149views Communications» more  FGCN 2007»
14 years 1 months ago
Cover Set Problem in Directional Sensor Networks
— A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets...
Yanli Cai, Wei Lou, Minglu Li
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
IJWIN
2006
209views more  IJWIN 2006»
13 years 7 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...