65 search results - page 13 / 13 » On approximating the maximum diameter ratio of graphs |
ALT
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
IPCCC
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
CCCG
2007
13 years 7 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
MOBIHOC
2008
ACM
14 years 5 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
IPPS
2008
IEEE
13 years 12 months ago
2008
IEEE
— Existing workflow systems attempt to achieve high performance by intelligently scheduling tasks on resources, sometimes even attempting to move the largest data files on the hi...