667 search results - page 87 / 134 » Approximation algorithms for connected facility location pro... |
89
Voted
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
112
click to vote
DIALM
2003
ACM
15 years 5 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
114
Voted
IEEECIT
2009
IEEE
15 years 7 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
80
Voted
JNSM
2008
15 years 16 days ago
2008
1 In this paper we address the problem of selecting probe station locations from where probes can be sent to monitor all the nodes in the network. Probe station placement involves...
88
Voted
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...