4894 search results - page 83 / 979 » The Guarding Problem - Complexity and Approximation |
121
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
108
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
127
Voted
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
115
Voted
CIE
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
139
click to vote
JCO
2008
15 years 2 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...