A polyhedral view to a generalization of multiple domination
type: Item
instance of: scholarly article
title: A polyhedral view to a generalization of multiple domination
zbMATH Open document ID: 1486.05232
author: José Neto
published in: Discrete Applied Mathematics
publication date: 2022-03-28T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7499190
zbMATH Keywords: dominating set
zbMATH Keywords: multiple domination
zbMATH Keywords: limited packing
zbMATH Keywords: polytope
MaRDI profile type: Publication
full work available at URL: j.dam.2022.01.011
OpenAlex ID: W4211251802
cites work: Characterizations of totally balanced matrices
cites work: The Dominating Set Polytope via Facility Location
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: Graph substitution and set packing polytopes
cites work: The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs
cites work: On the dominating set polytope
cites work: From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes
cites work: Combinatorial optimization. Packing and covering
cites work: On \(f\)-domination: polyhedral and algorithmic results
cites work: On total \(f\)-domination: polyhedral and algorithmic results
cites work: The multiple domination and limited packing problems in graphs
cites work: Domination, independent domination, and duality in strongly chordal graphs
cites work: Q3517176
cites work: Limited Packings in Graphs
cites work: Limited packings in graphs
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Convex Polytopes
cites work: Q4953552
cites work: Q4552196
cites work: Q4368728
cites work: Q4368729
cites work: Q3693537
cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
cites work: Limited packing and multiple domination problems: polynomial time reductions
cites work: Algorithmic aspect of \(k\)-tuple domination in graphs.
cites work: \(k\)-tuple domination in graphs
cites work: Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
cites work: On the facial structure of set packing polyhedra
cites work: New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
cites work: Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
cites work: A new domination conception
cites work: Proof of a conjecture on \(k\)-tuple domination in graphs
cites work: Lectures on Polytopes
cites work: On general frameworks and threshold functions for multiple domination
DOI: 10.1016/J.DAM.2022.01.011
Recommended article: A polyhedral view to generalized multiple domination and limited packing
Recommended article: Q5251996
Recommended article: On total \(f\)-domination: polyhedral and algorithmic results
Recommended article: On \(f\)-domination: polyhedral and algorithmic results
Recommended article: On general frameworks and threshold functions for multiple domination
Recommended article: On upper bounds for multiple domination numbers of graphs
Recommended article: Combinatorial bounds on paired and multiple domination in triangulations
Recommended article: On the dominating set polytope
Recommended article: An algorithm for prescribed multiple domination in arbitrary graphs
Recommended article: On the domination polynomial of some graph operations
description: scientific article; zbMATH DE number 7499190