628 search results - page 80 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
122
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
125
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
142
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
135
click to vote
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
124
click to vote
TPDS
2008
15 years 3 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...