1566 search results - page 123 / 314 » On a Cone Covering Problem |
202
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
165
click to vote
EXPCS
2007
15 years 10 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
199
click to vote
EC
2008
15 years 6 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
158
click to vote
PG
1999
IEEE
15 years 10 months ago
1999
IEEE
We present an automatic camera placement method for generating image-based models from scenes with known geometry. Our method first approximately determines the set of surfaces vi...
182
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...