1486 search results - page 27 / 298 » Algorithms for two-box covering |
154
click to vote
WEA
2007
Springer
16 years 7 hour 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 ...
179
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
156
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
