Sciweavers

1798 search results - page 272 / 360
» A Tree for All Seasons
Sort
View
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
14 years 4 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
FMCAD
2007
Springer
14 years 4 months ago
Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC
—When model-checking reports that a property holds on a model, vacuity detection increases user confidence in this result by checking that the property is satisfied in the inte...
Jocelyn Simmonds, Jessica Davies, Arie Gurfinkel, ...
FSTTCS
2007
Springer
14 years 4 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
FSTTCS
2007
Springer
14 years 4 months ago
Solving Parity Games in Big Steps
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Sven Schewe
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 4 months ago
Finding interesting things
Model- and simulation-designers are often interested not in the optimum output of their system, but in understanding how the output is sensitive to different parameters. This can...
Sean Luke, Deepankar Sharma, Gabriel Catalin Balan