Article ID Journal Published Year Pages File Type
7543427 Discrete Optimization 2018 8 Pages PDF
Abstract
We consider boolean linear programming formulations of the vertex and edge dominating set problems and prove their polynomial-time solvability for classes of graphs with constraint matrices having bounded minors in the absolute value.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Control and Optimization
Preview
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
Authors
, ,