Approximating some network design problems with node costs

Mathematics

• Network Design 100%
• Costs 58%
• Vertex of a graph 45%
• Bicriteria 19%
• Lower bound 14%
• Best Approximation 14%
• Approximation Algorithms 12%
• Covering 11%
• Subadditive Function 11%
• Approximation 11%
• Graph in graph theory 10%
• Path 9%
• Steiner Tree Problem 9%
• Multi-criteria 8%
• Violate 8%
• Disprove 8%
• Profit 8%
• Cost Function 7%
• Subgraph 5%
• Minimise 5%
• Unit 5%
• Polynomial 3%
• Family 3%

Engineering & Materials Science

• Costs 30%
• Approximation algorithms 28%
• Cost functions 12%
• Profitability 11%
• Polynomials 10%