10 research outputs found

    Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm

    No full text
    Abstract. We show that for every positive Δ> 0, unless N P ⊂ RP, it is impossible to approximate the maximum quadratic assignment problem within a factor better than 2 log1−Δ n by a reduction from the maximum label cover problem. Then, we present an O ( √ n)-approximation algorithm for the problem based on rounding of the linear programming relaxation often used in the state of the art exact algorithms.

    Bibliography

    No full text
    corecore