Stochastic Steiner trees without a root
From MaRDI portal
Recommendations
Cited in
(20)- Combinatorial optimization in system configuration design
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Network design for information networks
- Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
- Analysis of Steiner subtrees of random trees for traceroute algorithms
- Probabilistic models for the Steiner tree problem
- Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut
- Stochastic Steiner Tree with Non-uniform Inflation
- Steiner Forests on Stochastic Metric Graphs
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- A constant-factor approximation for stochastic Steiner forest
- LP Rounding Approximation Algorithms for Stochastic Network Design
- Infrastructure Leasing Problems
- Approximation algorithm for stochastic prize-collecting Steiner tree problem
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Sublinear metric Steiner tree via improved bounds for set cover
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
- Commitment under uncertainty: Two-stage stochastic matching problems
This page was built for publication: Stochastic Steiner trees without a root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716852)