7930 search results - page 274 / 1586 » Greedy in Approximation Algorithms |
184
click to vote
NIPS
1998
15 years 8 months ago
1998
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
231
click to vote
APPROX
2000
Springer
15 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
190
click to vote
FSTTCS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
160
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
149
click to vote
ORL
2006
15 years 6 months ago
2006
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...