Approximation algorithms and hardness results for labeled connectivity problems

Keyphrases

• Approximation Algorithms 100%
• Hardness Results 100%
• Hardness of Approximation 100%
• Connection Problem 100%
• Minimum Labelling Spanning Trees 100%
• Spanning Tree Problem 100%
• Improved Approximation 50%
• Connected Subgraphs 50%
• Minimum Cost 50%
• Edge Set 50%
• Spanning Tree 50%
• Multigraph 50%
• Path Problems 50%
• Negative Cost 50%
• Overall Cost 50%
• Integer-valued Function 50%

Computer Science

• Approximation Algorithms 100%
• Spanning Tree 100%
• Connectivity Problem 100%
• Connected Subgraph 33%
• Valued Function 33%