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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 84; číslo 3; s. 715 - 738
Hlavní autori:	Jia, Junhua, Guan, Xiucui, Zhang, Qiao, Qian, Xinqiang, Pardalos, Panos M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2022 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!