The adjacent only quadratic minimum spanning tree problem is an NP-hard version of the minimum spanning tree where the costs of interaction effects between every pair of adjacent edges are included… (More)

Given an edge-weighted simple graph G, the minimum quadratic spanning tree problem consists in finding a spanning tree of G such that the sum of the weights of its edges plus the sum of the product… (More)