On approximating degree-bounded network design problems

Keyphrases

• Tight 100%
• Network Design Problem 100%
• Steiner Tree Problem 100%
• Quasi-polynomial Time 100%
• Directed Steiner Tree 100%
• Popular 50%
• Approximation Algorithms 50%
• Bicriteria Approximation 50%
• Log-log 50%
• Theoretical Computer Science 50%
• Directed Graph 50%
• Hardness Results 50%
• Closing the Gap 50%
• Nearly Optimal 50%
• Set Cover 50%
• Group Steiner Tree 50%
• Bicriteria Approximation Algorithms 50%
• Degree Constraint 50%
• Degree Bounds 50%
• Optimum Solution 50%
• Combinatorial Optimization 50%
• Bounded Group 50%
• Minimum Cost Arborescence 50%
• K-factor 50%
• Approximation Lower Bounds 50%

Computer Science

• Approximation Algorithms 100%
• Polynomial Time 100%
• Network Design Problem 100%
• Approximation (Algorithm) 100%
• Steiner Tree Problem 100%
• Theoretical Computer Science 50%
• Directed Graphs 50%
• steiner tree 50%
• Degree Constraint 50%
• Optimum Solution 50%
• Combinatorial Optimisation 50%

Mathematics

• Bicriteria 100%
• Polynomial Time 100%
• Edge 50%
• Tree Problem 50%
• Group Steiner Tree Problem 50%