The Minimum Risk Spanning Tree Problem

DOI10.1007/978-3-540-73556-4_11MaRDI QIDQ3611957zbMATH OpenOpenAlexFDO

Authors Jie Hu, Xiaodong Hu, Xujin Chen

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_11

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10)

Recommendations

• A polynomial solvable minimum risk spanning tree problem with interval data
• scientific article; zbMATH DE number 5629898
• Deterministic risk control for cost-effective network connections
• The robust spanning tree problem with interval data
• Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty

Cited in

(9)

• A polynomial solvable minimum risk spanning tree problem with interval data
• Min-max controllable risk problems
• The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
• On the Minimum Risk-Sum Path Problem
• Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty
• Min‐sum controllable risk problems with concave risk functions of the same value range
• Minimizing maximum risk for fair network connection with interval data
• An improved algorithm for finding minimum-risk 3-state-device networks
• Interactive decision making for uncertain minimum spanning tree problems with total importance based on a risk-management approach

This page was built for publication: The Minimum Risk Spanning Tree Problem

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