MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS

DOI10.15807/JORSJ.24.61MaRDI QIDQ3902854zbMATH OpenOpenAlexFDO

Authors Tetsuo Ichimori, Shôgo Shiode, Toshio Nishida, 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) Trees (05C05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902854)