On combinatorial optimization for dominating sets (literature survey, new models)

09/19/2020
by   Mark Sh. Levin, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/04/2019

An Integer Linear Programming Formulation for the Convex Dominating Set Problems

Due to their importance in practice, dominating set problems in graphs h...
research
06/25/2019

On the definition of likelihood function

We discuss a general definition of likelihood function in terms of Radon...
research
01/28/2019

Dominating Sets and Connected Dominating Sets in Dynamic Graphs

In this paper we study the dynamic versions of two basic graph problems:...
research
03/02/2022

Weighted domination models and randomized heuristics

We consider the minimum weight and smallest weight minimum-size dominati...
research
08/29/2018

The eternal dominating set problem for interval graphs

We prove that, in games in which all the guards move at the same turn, t...
research
10/11/2021

Binary Programming Formulations for the Upper Domination Problem

We consider Upper Domination, the problem of finding the minimal dominat...
research
06/09/2017

Towards balanced clustering - part 1 (preliminaries)

The article contains a preliminary glance at balanced clustering problem...

Please sign up or login with your details

Forgot password? Click here to reset