On the minimum corridor connection and other generalized geometrich problems.

H.L. Bodlaender, C. Feremans, A. Grigoriev*, E. Penninkx, R. Sitters, T. Wolle

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


In this paper we discuss the complexity and approximability of the minimum corridor connection problem where, given a rectilinear decomposition of a rectilinear polygon into “rooms”, one has to find the minimum length tree along the edges of the decomposition such that every room is incident to a vertex of the tree. We show that the problem is strongly np-hard and give a subexponential time exact algorithm. For the special case when the room connectivity graph is k-outerplanar the algorithm running time becomes cubic. We develop a polynomial time approximation scheme for the case when all rooms are fat and have nearly the same size. When rooms are fat but are of varying size we give a polynomial time constant factor approximation algorithm.
Original languageEnglish
Pages (from-to)939-951
Number of pages12
JournalComputational Geometry-Theory and Applications
Issue number9
Publication statusPublished - 1 Jan 2009


Dive into the research topics of 'On the minimum corridor connection and other generalized geometrich problems.'. Together they form a unique fingerprint.

Cite this