628 search results - page 61 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
176
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
270
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
151
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
168
click to vote
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
164
click to vote
DAM
2008
15 years 6 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...