MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS

DOI10.15807/jorsj.24.61zbMath0454.90080OpenAlexW2562791530MaRDI QIDQ3902854

Shôgo Shiode, Toshio Nishida, Tetsuo Ichimori, Hiroaki Ishii

Publication date: 1981

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.24.61

zbMATH Keywords

combinatorial optimizationminimum spanning treeexponential algorithmnormal variates as weights

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05)

Related Items (3)

An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion ⋮ A fully polynomial time approximation scheme for minimum cost-reliability ratio problems ⋮ A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program

This page was built for publication: MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS