Approximate k-steiner forests via the lagrangian relaxation technique with internal preprocessing

Keyphrases

• Steiner Forest Problem 100%
• Lagrangian Relaxation 100%
• Steiner Forest 100%
• Approximation Algorithms 50%
• Number of Vertices 50%
• Minimum Cost 50%
• Undirected Graph 50%
• K Parameter 50%
• Inapproximability 50%
• Negative Cost 50%
• Densest K-subgraph Problem 50%

Mathematics

• Approximates 100%
• Lagrangian 100%
• Edge 50%

Computer Science

• Lagrangian Relaxation 100%
• Approximation Algorithms 50%
• Directed Graphs 50%
• Subgraphs 50%