On combinatorial optimization for dominating sets (literature survey, new models)
Data Structures and Algorithms
2020-09-22 v1 Artificial Intelligence
Optimization and Control
Abstract
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set problems are illustrated by simplifyed numerical examples. New integer programming formulations of dominating set problems (with multiset estimates) are suggested.
Cite
@article{arxiv.2009.09288,
title = {On combinatorial optimization for dominating sets (literature survey, new models)},
author = {Mark Sh. Levin},
journal= {arXiv preprint arXiv:2009.09288},
year = {2020}
}
Comments
17 pages, figures 6, table 5