On the approximability of robust spanning tree problems
From MaRDI portal
Recommendations
- On the complexity of the robust spanning tree problem with interval data
- On the approximability of some maximum spanning tree problems
- On the approximability of some Maximum Spanning Tree Problems
- The robust spanning tree problem with interval data
- scientific article; zbMATH DE number 1330076
- Robust discrete spanning tree problem: local search algorithms
- A branch and bound algorithm for the robust spanning tree problem with interval data
- The robust minimum spanning tree problem: compact and convex uncertainty
- Approximation algorithms for quickest spanning tree problems
- Algorithms – ESA 2004
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 795107 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- A threshold of ln n for approximating set cover
- Approximating Single Machine Scheduling with Scenarios
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Commitment under uncertainty: Two-stage stochastic matching problems
- Free Bits, PCPs, and Nonapproximability---Towards Tight Results
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Introduction to Stochastic Programming
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Network flows. Theory, algorithms, and applications.
- On Two-Stage Stochastic Minimum Spanning Trees
- On the approximability of minmax (regret) network optimization problems
- On the random 2-stage minimum spanning tree
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
- Robust discrete optimization and its applications
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
Cited in
(25)- The robust minimum spanning tree problem: compact and convex uncertainty
- On the random 2-stage minimum spanning tree
- Simulated annealing algorithm for the robust spanning tree problem
- Two-stage combinatorial optimization problems under risk
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- Robust recoverable and two-stage selection problems
- The robust spanning tree problem with interval data
- Recoverable robust spanning tree problem under interval uncertainty representations
- scientific article; zbMATH DE number 1330076 (Why is no real title available?)
- On the complexity of robust multi-stage problems with discrete recourse
- Minimax regret spanning arborescences under uncertain costs
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Robust Algorithms for TSP and Steiner Tree
- Using the WOWA operator in robust discrete optimization problems
- On exact solutions for the minmax regret spanning tree problem
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- A branch and bound algorithm for the robust spanning tree problem with interval data
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- Combinatorial two-stage minmax regret problems under interval uncertainty
- On Two-Stage Stochastic Minimum Spanning Trees
This page was built for publication: On the approximability of robust spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620950)
