7930 search results - page 256 / 1586 » Greedy in Approximation Algorithms |
162
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
194
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
168
click to vote
WDAG
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
164
click to vote
AAAI
1996
15 years 7 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
