By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Arora, S. ; Dept. of Comput. Sci., Princeton Univ., NJ, USA ; Frieze, A. ; Kaplan, H.

We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satisfies any linear inequality, then with high probability, the new matching satisfies that linear inequality in an approximate sense. This extends the well-known LP rounding procedure of Raghavan and Thompson (1987), which is usually used to round fractional solutions of linear programs. It also solves an open problem of Luby and Nisan (1993) (“Design an NC procedure for converting near-optimum fractional matchings to near-optimum matchings.”) We use the rounding procedure to design n0(logn/ε(2)) time algorithms for the following: (i) an additive approximation to the 0-1 Quadratic Assignment problem (QAP); (ii) a (1+E)-approximation for “dense” instances of many well-known NP-hard problems, including (an optimization formulation of) GRAPH-ISOMORPHISM, MIN-CUT-LINEAR-ARRANGEMENT, MAX-ACYCLIC-SUBGRAPH, MIN-LINEAR-ARRANGEMENT, and BETWEENNESS. (A “dense” graph is one in which the number of edges is Ω(n2); denseness for the other problems is defined in an analogous way)

Published in:

Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on

Date of Conference:

14-16 Oct 1996