628 search results - page 56 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
151
Voted
CCCG
2003
15 years 4 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
151
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
160
click to vote
MOR
2007
15 years 2 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
141
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...