On conflict-free chromatic guarding of simple polygons
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00107778" target="_blank" >RIV/00216224:14330/19:00107778 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-36412-0_49" target="_blank" >http://dx.doi.org/10.1007/978-3-030-36412-0_49</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-36412-0_49" target="_blank" >10.1007/978-3-030-36412-0_49</a>
Alternative languages
Result language
angličtina
Original language name
On conflict-free chromatic guarding of simple polygons
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA17-00837S" target="_blank" >GA17-00837S: Structural properties, parameterized tractability and hardness in combinatorial problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
13th Annual International Conference on Combinatorial Optimization and Applications (COCOA'19)
ISBN
9783030364113
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
601-612
Publisher name
Springer, Lecture Notes in Computer Science, volume 11949
Place of publication
Cham
Event location
Cham
Event date
Jan 1, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—