The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Selected topics on assignment problems
Discrete Applied Mathematics
Circular arrangements and cyclic broadcast scheduling
Journal of Algorithms
Approximate and dynamic rank aggregation
Theoretical Computer Science - Special papers from: COCOON 2003
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
On the tandem duplication-random loss model of genome rearrangement
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Ordering by weighted number of wins gives a good ranking for weighted tournaments
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem
Fundamenta Informaticae
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
Proceedings of the forty-first annual ACM symposium on Theory of computing
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
Mathematics of Operations Research
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Energy-efficient data gathering in wireless sensor networks with asynchronous sampling
ACM Transactions on Sensor Networks (TOSN)
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Layout problems on lattice graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Ordering by weighted number of wins gives a good ranking for weighted tournaments
ACM Transactions on Algorithms (TALG)
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computing the cutwidth of bipartite permutation graphs in linear time
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem
Fundamenta Informaticae
| Hi-index | 0.00 |
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).