1647 search results - page 31 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
IPL
1998
13 years 8 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
CCE
2004
13 years 8 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
JCO
2007
13 years 8 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
IPCO
1996
13 years 10 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...