3874 search results - page 25 / 775 » Approximation Algorithms for k-hurdle Problems |
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
4OR
2008
14 years 9 months ago
2008
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
75
Voted
UAI
1994
14 years 11 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
JCO
2008
14 years 9 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
62
Voted
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...