4894 search results - page 500 / 979 » The Guarding Problem - Complexity and Approximation |
116
click to vote
JNS
2010
14 years 11 months ago
2010
Under certain conditions the problem of morphogenesis in development and the problem of morphology in block copolymers may be reduced to one geometric problem. In two dimensions t...
165
click to vote
TEC
2010
14 years 11 months ago
2010
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
143
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
166
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
140
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...