Approximation of rectangle stabbing and interval stabbing problems

S. Kovaleva, F.C.R. Spieksma

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

3 Citations (Scopus)

Abstract

The weighted rectangle multi-stabbing problem (WRMS) can be described as follows: given is a grid in IR2 consisting of columns and rows each having a positive integral weight, and a set of closed axis-parallel rectangles each having a positive integral demand. The rectangles are placed arbitrarily in the grid with the only assumption that each rectangle is intersected by at least one column and at least one row. The objective is to find a minimum weight (multi)set of columns and rows of the grid so that for each rectangle the total multiplicity of selected columns and rows stabbing it is at least its demand. (A column or row is said to stab a rectangle if it intersects it.)
Original languageEnglish
Title of host publicationAlgorithms – ESA 2004
Subtitle of host publication12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings
EditorsS. Albers, T. Radzik
Place of PublicationBerlin
PublisherSpringer
Pages426-435
ISBN (Electronic)978-3-540-30140-0
ISBN (Print)978-3-540-23025-0
DOIs
Publication statusPublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
Volume3221

Cite this

Kovaleva, S., & Spieksma, F. C. R. (2004). Approximation of rectangle stabbing and interval stabbing problems. In S. Albers, & T. Radzik (Eds.), Algorithms – ESA 2004: 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004. Proceedings (pp. 426-435). (Lecture Notes in Computer Science ; Vol. 3221). Springer. https://doi.org/10.1007/978-3-540-30140-0_39