Inverse max+sum spanning tree problem under weighted l∞ norm by modifying max-weight vector

The max+sum spanning tree ( MSST ) problem is to determine a spanning tree T whose combined weight max e ∈ T w ( e ) + ∑ e ∈ T c ( e ) is minimum for a given edge-weighted undirected network G ( V ,  E ,  c ,  w ). This problem can be solved within O ( m log n ) time, where m and n are the numbers o...

Ausführliche Beschreibung