A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

Keyphrases

• Assignment Problem 100%
• Dense Graphs 100%
• Rounding Procedures 100%
• Linear Inequalities 66%
• High Probability 33%
• NP-hard 33%
• Linear Programming 33%
• Approximation Algorithms 33%
• Fractional Solutions 33%
• Approximation Error 33%
• Polynomial-time Approximation Scheme 33%
• Additive Approximation 33%
• Linear Arrangement 33%
• LP-rounding 33%
• Quadratic Assignment Problem 33%
• Maximum Acyclic Subgraph 33%
• Minimum Cut 33%
• Randomized Procedure 33%
• Fractional Perfect Matching 33%
• Integral Matching 33%
• Fractional Matching 33%
• Minimum Linear Arrangement 33%

Mathematics

• Rounding Procedure 100%
• Linear Inequality 66%
• Approximates 33%
• Probability Theory 33%
• Linear Program 33%
• Polynomial Time 33%
• Approximation Error 33%
• Perfect Matchings 33%