Approximating some network design problems with node costs

Keyphrases

• Multi-commodity 100%
• Network Design Problem 100%
• Buy-at-bulk 100%
• Node Cost 100%
• Approximation Algorithms 50%
• Cover Tree 50%
• Maximum Covering 50%
• Log 2 50%
• Universal Constants 25%
• Edge Length 25%
• Cost Function 25%
• Steiner Tree Problem 25%
• Bicriteria Approximation 25%
• Undirected Network 25%
• Shallow Light Steiner Trees 25%
• Minimum Length 25%
• Multi-criteria 25%
• Approximation Ratio 25%
• Flow Unit 25%
• Tree Moss 25%
• Subadditive 25%
• Log-log 25%
• Single-path 25%
• Mannan-oligosaccharide 25%
• Cost Distance 25%
• Distance Problems 25%
• Quasi-P 25%
• Bi-criteria 25%

Mathematics

• Edge 100%
• Tree Problem 100%
• Opts _ _ _ 100%
• Bicriteria 100%
• Cost Function 50%
• Subadditive 50%
• Total Amount 50%
• Polynomial 50%
• Minimizes 50%

Computer Science

• Network Design Problem 100%
• Approximation (Algorithm) 100%
• Approximation Algorithms 66%
• Approximation Ratio 33%
• Undirected Network 33%
• Subgraphs 33%
• Steiner Tree Problem 33%
• Subadditive 33%