201 search results - page 18 / 41 » The Minimum Substring Cover Problem |
146
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
102
click to vote
ACL
2012
13 years 2 months ago
2012
The problem addressed in this paper is to segment a given multilingual document into segments for each language and then identify the language of each segment. The problem was mot...