7930 search results - page 129 / 1586 » Greedy in Approximation Algorithms |
163
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
124
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
197
click to vote
IPL
2008
15 years 6 months ago
2008
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
165
click to vote
IPL
2011
15 years 1 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
152
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...