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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 84; no. 3; pp. 715 - 738
Main Authors:	Jia, Junhua, Guan, Xiucui, Zhang, Qiao, Qian, Xinqiang, Pardalos, Panos M.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2022 Springer Nature B.V
Subjects:	Algorithms Computer Science Graph theory Iterative methods Linear programming Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Real Functions Weighted Strongly polynomial time algorithm Binary search method Inverse max+sum spanning tree norm
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!