Planar Three-Index Assignment Problem via Dependent Contention Resolution

In this paper we design an approximation algorithm for the planar three-dimensional assignment problem with performance guarantee 0:669. The algorithm is based on a novel rounding technique of the linear programming relaxation (the dependent contention resolution) that might be interesting in its own right and applied to other optimization problems.

By: Dmitriy Katz-Rogozhnikov, Maxim Sviridenko

Published in: RC24942 in 2010


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .