1566 search results - page 37 / 314 » On a Cone Covering Problem |
159
click to vote
AML
2007
15 years 6 months ago
2007
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
154
click to vote
WEA
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
162
click to vote
CCCG
2001
15 years 7 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
187
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
167
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...