Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1578018,
author = {Cagirici, Onur and Ghosh, Subir and Hliněný, Petr and Roy, Bodhayan},
address = {Cham},
booktitle = {13th Annual International Conference on Combinatorial Optimization and Applications (COCOA'19)},
doi = {http://dx.doi.org/10.1007/978-3-030-36412-0_49},
keywords = {polygon visibility graph; graph coloring; polygon guarding},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Cham},
isbn = {978-3-030-36411-3},
pages = {601-612},
publisher = {Springer, Lecture Notes in Computer Science, volume 11949},
title = {On conflict-free chromatic guarding of simple polygons},
url = {http://dx.doi.org/10.1007/978-3-030-36412-0_49},
year = {2019}
}
TY - JOUR
ID - 1578018
AU - Cagirici, Onur - Ghosh, Subir - Hliněný, Petr - Roy, Bodhayan
PY - 2019
TI - On conflict-free chromatic guarding of simple polygons
PB - Springer, Lecture Notes in Computer Science, volume 11949
CY - Cham
SN - 9783030364113
KW - polygon visibility graph
KW - graph coloring
KW - polygon guarding
UR - http://dx.doi.org/10.1007/978-3-030-36412-0_49
N2 - We study the problem of colouring the vertices of a polygon, such that every viewer can see a unique colour. The goal is to minimize the number of colours used. This is also known as the conflict-free chromatic guarding problem with vertex guards, and is motivated, e.g., by the problem of radio frequency assignment to sensors placed at the polygon vertices.
ER -
CAGIRICI, Onur, Subir GHOSH, Petr HLINĚNÝ and Bodhayan ROY. On conflict-free chromatic guarding of simple polygons. Online. In \textit{13th Annual International Conference on Combinatorial Optimization and Applications (COCOA'19)}. Cham: Springer, Lecture Notes in Computer Science, volume 11949, 2019, p.~601-612. ISBN~978-3-030-36411-3. Available from: https://dx.doi.org/10.1007/978-3-030-36412-0\_{}49.
|
