74 search results - page 1 / 15 » Smallest Color-Spanning Objects |
ESA
2001
Springer
13 years 9 months ago
2001
Springer
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and...
IJCM
2002
13 years 4 months ago
2002
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
ALGORITHMICA
1998
13 years 4 months ago
1998
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
SIAMCO
2011
12 years 11 months ago
2011
Given a nominal plant, together with a fixed neighborhood of this plant, the problem of robust stabilization is to find a controller that stabilizes all plants in that neighborh...
TIM
2010
12 years 11 months ago
2010
This paper presents a watermarking algorithm that is suitable for the data represented in floating- or fixed-point numbers. By keeping the modulation information, every value in th...