Covering geometric domains

Gila Morgenstern

doi:10.1017/9781108592376.015

Covering geometric domains

Gila Morgenstern

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

This chapter surveys a graph-based approach in covering geometric domains. Geometric covering problems are normally NP-hard, yet under specified restrictions some are reduced to optimization problems on perfect graphs, and thus are solvable in polynomial time. This chapter surveys some of these problems, and demonstrates the connection between covering problems of geometric domains and the clique cover of perfect graphs.

Original language	English
Title of host publication	Encyclopedia of Mathematics and its Applications
Subtitle of host publication	Topics in Algorithmic Graph Theory
Publisher	Cambridge University Press
Pages	246-261
Number of pages	16
ISBN (Electronic)	9781108592376
ISBN (Print)	9781108492607
DOIs	https://doi.org/10.1017/9781108592376.015
State	Published - 3 Jun 2021
Externally published	Yes

ASJC Scopus subject areas

General Mathematics
General Computer Science

Access to Document

10.1017/9781108592376.015

Cite this

@inbook{ff51d2e34dfe45b48d085b081011dd5c,

title = "Covering geometric domains",

abstract = "This chapter surveys a graph-based approach in covering geometric domains. Geometric covering problems are normally NP-hard, yet under specified restrictions some are reduced to optimization problems on perfect graphs, and thus are solvable in polynomial time. This chapter surveys some of these problems, and demonstrates the connection between covering problems of geometric domains and the clique cover of perfect graphs.",

author = "Gila Morgenstern",

year = "2021",

month = jun,

day = "3",

doi = "10.1017/9781108592376.015",

language = "English",

isbn = "9781108492607",

pages = "246--261",

booktitle = "Encyclopedia of Mathematics and its Applications",

publisher = "Cambridge University Press",

address = "United Kingdom",

}

TY - CHAP

T1 - Covering geometric domains

AU - Morgenstern, Gila

PY - 2021/6/3

Y1 - 2021/6/3

N2 - This chapter surveys a graph-based approach in covering geometric domains. Geometric covering problems are normally NP-hard, yet under specified restrictions some are reduced to optimization problems on perfect graphs, and thus are solvable in polynomial time. This chapter surveys some of these problems, and demonstrates the connection between covering problems of geometric domains and the clique cover of perfect graphs.

AB - This chapter surveys a graph-based approach in covering geometric domains. Geometric covering problems are normally NP-hard, yet under specified restrictions some are reduced to optimization problems on perfect graphs, and thus are solvable in polynomial time. This chapter surveys some of these problems, and demonstrates the connection between covering problems of geometric domains and the clique cover of perfect graphs.

UR - https://www.scopus.com/pages/publications/105024391389

U2 - 10.1017/9781108592376.015

DO - 10.1017/9781108592376.015

M3 - Chapter

AN - SCOPUS:105024391389

SN - 9781108492607

SP - 246

EP - 261

BT - Encyclopedia of Mathematics and its Applications

PB - Cambridge University Press

ER -

Covering geometric domains

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this