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

Content Provider	IEEE Xplore Digital Library
Author	Arora, S. Frieze, A. Kaplan, H.
Copyright Year	1996
Description	Author affiliation: Dept. of Comput. Sci., Princeton Univ., NJ, USA (Arora, S.)
Abstract	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 n/sup 0(logn//spl epsiv/(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 /spl Omega/(n/sup 2/); denseness for the other problems is defined in an analogous way).
Starting Page	21
Ending Page	30
File Size	1001411
Page Count	10
File Format	PDF
ISBN	0818675942
ISSN	02725428
DOI	10.1109/SFCS.1996.548460
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1996-10-14
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Contracts Constraint optimization Operations research Cost function Integer linear programming Vectors Approximation algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems (2002)

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (1996).

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (2001).

A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems (1996)

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

Approximating bounded 0-1 integer linear programs

Improved Approximation Guarantees for Packing and Covering Integer Programs

Csc5160: combinatorial optimization and approximation algorithms topic: introducton to linear and integer programming date: 14/02/2008.

Gadgets, approximation, and linear programming

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

Similar Documents

A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems (2002)

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (1996).

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (2001).

A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems (1996)

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

Approximating bounded 0-1 integer linear programs

Improved Approximation Guarantees for Packing and Covering Integer Programs

Csc5160: combinatorial optimization and approximation algorithms topic: introducton to linear and integer programming date: 14/02/2008.

Gadgets, approximation, and linear programming

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