Approximation algorithms for the 0-extension problem

Keyphrases

• Approximation Algorithms 100%
• 0-Extension 100%
• Extension Problem 100%
• Tardos 66%
• Approximation Guarantee 33%
• Planar Graph 33%
• Arbitrary Graphs 33%
• Edge Weight 33%
• Weighted Graph 33%
• Semi-metric 33%
• Natural Metric 33%
• Labeling Problem 33%
• Cutting Problem 33%
• Linear Programming Relaxation 33%
• Metric Labeling 33%
• Integrality Ratio 33%
• Multiway Cut 33%
• Graph Partitioning 33%
• Foundations of Computer Science 33%
• Annual Symposium 33%

Mathematics

• Edge 100%
• Minimizes 50%
• Partitioning Problem 50%
• Planar Graph 50%
• Graph Partition 50%
• weighted graph 50%
• Linear Programming Relaxation 50%