Sciweavers

3874 search results - page 57 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
COCOON
2003
Springer
15 years 3 months ago
Randomized Approximation of the Stable Marriage Problem
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
Magnús M. Halldórsson, Kazuo Iwama, ...
AUSAI
2004
Springer
15 years 3 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
CIAC
2006
Springer
110views Algorithms» more  CIAC 2006»
15 years 1 months ago
Distance Approximating Trees: Complexity and Algorithms
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
Feodor F. Dragan, Chenyu Yan
FOCS
2009
IEEE
15 years 4 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
FOCS
2009
IEEE
15 years 4 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...