NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem

From MaRDI portal
Publication:860400