Sciweavers

17 search results - page 1 / 4
» Coloring axis-parallel rectangles
Sort
View
GD
2003
Springer
13 years 9 months ago
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
STOC
1999
ACM
123views Algorithms» more  STOC 1999»
13 years 9 months ago
Covering Rectilinear Polygons with Axis-Parallel Rectangles
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
V. S. Anil Kumar, H. Ramesh
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
13 years 8 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar
TALG
2008
152views more  TALG 2008»
13 years 4 months ago
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...
CCCG
2008
13 years 6 months ago
Searching for Frequent Colors in Rectangles
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
Marek Karpinski, Yakov Nekrich