Two-stage robust network design with exponential scenarios

Keyphrases

• Steiner Tree 100%
• Robust Network Design 100%
• Foundations of Computer Science 40%
• Computer Science 40%
• Steiner Forest 40%
• Theoretical Aspects 40%
• Program Optimization 40%
• Combinatorial Optimization 40%
• High Cost 40%
• Integer Programming 40%
• Uncapacitated Facility Location Problem 40%
• Annual Symposium 40%
• Undirected Graph 20%
• Approximation Algorithms 20%
• Facility Location 20%
• Network Design Problem 20%
• Steiner Tree Problem 20%
• APX-hardness 20%
• Inflation 20%
• Constant-factor Approximation Algorithm 20%
• Steiner Forest Problem 20%
• Logarithmic Approximation 20%
• Singleton 20%
• Facility Location Problem 20%
• Robust Optimization Problem 20%
• Min-cut 20%
• Exponential number 20%
• Planning Problem 20%
• Combinatorial Optimization Problem 20%
• Optimum Cost 20%
• Constant Approximation 20%
• Cutting Problem 20%
• Robust Problems 20%
• Two-stage Planning 20%

Mathematics

• Edge 100%
• Integer Programming 100%
• Open Question 50%
• Worst Case 50%
• Tree Problem 50%
• Minimizes 50%
• Multiplicative 50%
• Constant Factor 50%
• Total Cost 50%
• Graph-Like 50%
• Min-Cut 50%
• Case Scenario 50%
• Combinatorial Optimization Problem 50%

Computer Science

• Network Design 100%
• steiner tree 100%
• Computer Science 80%
• Approximation Algorithms 40%
• Location Problem 40%
• Combinatorial Optimisation 40%
• Integer Programming 40%
• Directed Graphs 20%
• Network Design Problem 20%
• Approximation (Algorithm) 20%
• Logarithmic Approximation 20%
• Optimization Problem 20%
• Steiner Tree Problem 20%
• Constant Factor 20%
• Singletons 20%
• Planning Stage 20%
• Exponential Number 20%
• Robust Optimization 20%
• Combinatorial Optimization Problem 20%