The prison yard problem

Z. Füredi, D. J. Kleitman

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Given a polygon II with n vertices whose sides are walls. Guards, located at vertices can see all directions, but cannot see beyond walls. We prove that at most [n/2] guards suffice to see everywhere the whole plane. If II is not convex, then [n/2] suffice.

Original languageEnglish
Pages (from-to)287-300
Number of pages14
JournalCombinatorica
Volume14
Issue number3
DOIs
Publication statusPublished - Sep 1994

Fingerprint

Prisons
Polygon

Keywords

  • AMS subject classification code (1991): 52A30

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

The prison yard problem. / Füredi, Z.; Kleitman, D. J.

In: Combinatorica, Vol. 14, No. 3, 09.1994, p. 287-300.

Research output: Contribution to journalArticle

Füredi, Z & Kleitman, DJ 1994, 'The prison yard problem', Combinatorica, vol. 14, no. 3, pp. 287-300. https://doi.org/10.1007/BF01212977
Füredi, Z. ; Kleitman, D. J. / The prison yard problem. In: Combinatorica. 1994 ; Vol. 14, No. 3. pp. 287-300.
@article{6a0f1e5ecadb4045a503e29e2a0002d7,
title = "The prison yard problem",
abstract = "Given a polygon II with n vertices whose sides are walls. Guards, located at vertices can see all directions, but cannot see beyond walls. We prove that at most [n/2] guards suffice to see everywhere the whole plane. If II is not convex, then [n/2] suffice.",
keywords = "AMS subject classification code (1991): 52A30",
author = "Z. F{\"u}redi and Kleitman, {D. J.}",
year = "1994",
month = "9",
doi = "10.1007/BF01212977",
language = "English",
volume = "14",
pages = "287--300",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "3",

}

TY - JOUR

T1 - The prison yard problem

AU - Füredi, Z.

AU - Kleitman, D. J.

PY - 1994/9

Y1 - 1994/9

N2 - Given a polygon II with n vertices whose sides are walls. Guards, located at vertices can see all directions, but cannot see beyond walls. We prove that at most [n/2] guards suffice to see everywhere the whole plane. If II is not convex, then [n/2] suffice.

AB - Given a polygon II with n vertices whose sides are walls. Guards, located at vertices can see all directions, but cannot see beyond walls. We prove that at most [n/2] guards suffice to see everywhere the whole plane. If II is not convex, then [n/2] suffice.

KW - AMS subject classification code (1991): 52A30

UR - http://www.scopus.com/inward/record.url?scp=4243180670&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4243180670&partnerID=8YFLogxK

U2 - 10.1007/BF01212977

DO - 10.1007/BF01212977

M3 - Article

VL - 14

SP - 287

EP - 300

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 3

ER -