2496 search results - page 135 / 500 » On covering by translates of a set |
171
click to vote
RIAO
2000
15 years 7 months ago
2000
With the globalization of the world markets, the need for multilingual information processing increases, because the users are increasingly forced to deal with information availab...
205
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...
154
click to vote
DLT
2006
15 years 7 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
154
click to vote
TALG
2008
15 years 6 months ago
2008
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
212
click to vote
ICALP
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...