A characterization of linearizable instances of the quadratic minimum spanning tree problem
- 80 Downloads
We investigate special cases of the quadratic minimum spanning tree problem (QMSTP) on a graph \(G=(V,E)\) that can be solved as a linear minimum spanning tree problem. We give a characterization of such problems when G is a complete graph, which is the standard case in the QMSTP literature. We extend our characterization to a larger class of graphs that include complete bipartite graphs and cactuses, among others. Our characterization can be verified in \(O(|E|^2)\) time. In the case of complete graphs and when the cost matrix is given in factored form, we show that our characterization can be verified in O(|E|) time. Related open problems are also indicated.
KeywordsMinimum spanning tree Quadratic 0–1 problems Quadratic minimum spanning tree Polynomially solvable cases Linearization
This research work was supported by an NSERC discovery Grant and an NSERC discovery accelerator supplement awarded to Abraham P. Punnen.
- Ćustić A (2014) Efficiently solvable special cases of multidimensional assignment problems. Ph.D. thesis, TU GrazGoogle Scholar
- Ćustić A, Sokol V, Punnen AP, Bhattacharya B (2017) The bilinear assignment problem: complexity and polynomially solvable special cases. Math Program. doi: 10.1007/s10107-017-1111-1
- Ćustić A, Zhang R, Punnen AP (2016) The quadratic minimum spanning tree problem and its variations. Discrete Optim. doi: 10.1016/j.disopt.2017.09.003
- Palubeckis G, Rubliauskas D, Targamadzė A (2010) Metaheuristic approaches for the quadratic minimum spanning tree problem. Inf Technol Control 29:257–268Google Scholar
- Punnen AP (2001) Combinatorial optimization with multiplicative objective function. Int J Oper Quant Manag 7:205–209Google Scholar
- Punnen AP, Woods B (2017) A characterizations of linearizable instances of the quadratic travelling salesman problem. arXiv:1708.07217v2 [cs.DM]