628 search results - page 45 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
146
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
127
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
125
click to vote
WSC
2008
15 years 5 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
167
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
145
click to vote
STACS
2001
Springer
15 years 7 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...