1424 search results - page 137 / 285 » The Multi-radius Cover Problem |
107
click to vote
JGAA
2006
15 years 3 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
138
click to vote
TIT
2008
15 years 3 months ago
2008
We consider the problem of transmitting data at rate over a state-dependent channel with state information available at the sender and at the same time conveying the information ab...
130
Voted
IJCGA
2000
15 years 3 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
128
click to vote
ORDER
2007
15 years 2 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
127
click to vote
SAC
2008
ACM
15 years 2 months ago
2008
ACM
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...