论文信息 - The computational complexity of dominating set problems for instances with bounded minors of constraint matrices - 字舞流文

The computational complexity of dominating set problems for instances with bounded minors of constraint matrices

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.

Dmitriy S. Malyshev | Dmitry V. Gribanov

[1] Udi Rotics,et al. Edge dominating set and colorings on graphs with fixed clique-width , 2003, Discret. Appl. Math..

[2] Rico Zenklusen,et al. A strongly polynomial algorithm for bimodular integer linear programming , 2017, STOC.

[3] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[4] Sergey I. Veselov,et al. Integer program with bimodular matrix , 2008, Discret. Optim..

[5] Robert M. Gray,et al. Toeplitz and Circulant Matrices: A Review , 2005, Found. Trends Commun. Inf. Theory.

[6] Vadim V. Lozin,et al. Critical properties of graphs of bounded clique-width , 2013, Discret. Math..

[7] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

[8] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[9] Feodor F. Dragan,et al. On linear and circular structure of (claw, net)-free graphs , 2003, Discret. Appl. Math..

[10] Santosh S. Vempala,et al. A note on non-degenerate integer programs with small sub-determinants , 2016, Oper. Res. Lett..

[11] Valery Shevchenko. Qualitative Topics in Integer Linear Programming , 1996 .