Results 1  10
of
35
Improved Approximation Algorithms for MAX kCUT and MAX BISECTION
, 1994
"... Polynomialtime approximation algorithms with nontrivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks ..."
Abstract

Cited by 163 (0 self)
 Add to MetaCart
Polynomialtime approximation algorithms with nontrivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks of equal cardinality, again so as to maximise the weight of crossing edges. The approach, pioneered by Goemans and Williamson, is via a semidefinite relaxation. 1 Introduction Goemans and Williamson [5] have significantly advanced the theory of approximation algorithms. Previous work on approximation algorithms was largely dependent on comparing heuristic solution values to that of a Linear Program (LP) relaxation, either implicitly or explicitly. This was recognised some time ago by Wolsey [11]. (One significant exception to this general rule has been the case of Bin Packing.) The main novelty of [5] is that it uses a SemiDefinite Program (SDP) as a relaxation. To be more precise let...
On syntactic versus computational views of approximability
 SIAM JOURNAL ON COMPUTING
, 1999
"... We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximabilit ..."
Abstract

Cited by 118 (12 self)
 Add to MetaCart
We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximability is wellunderstood. Our results provide a syntactic characterization of computational classes, and give a computational framework for syntactic classes. We compare the syntactically defined class MAX SNP with the computationally defined class APX, and show that every problem in APX can be “placed ” (i.e. has approximation preserving reduction to a problem) in MAX SNP. Our methods introduce a general technique for creating approximationpreserving reductions which show that any “well ” approximable problem can be reduced in an approximationpreserving manner to a problem which is hard to approximate to corresponding factors. We demonstrate this technique by applying it to the classes RMAX(2) and MIN F+Π2(1)which have the clique problem and the set cover problem, respectively, as complete problems. We use the syntactic nature of MAX SNP to define a general paradigm, nonoblivious local search, useful for developing simple yet efficient approximation algorithms. We show that such algorithms can find good approximations for all MAX SNP problems, yielding approximation ratios comparable to the bestknown for a variety of specific MAX SNPhard problems. Nonoblivious local search provably outperforms standard local search in both the degree of approximation achieved and the efficiency of the resulting algorithms.
On Some Tighter Inapproximability Results
, 1998
"... We prove a number of improved inaproximability results, including the best up to date explicit approximation thresholds for MIS problem of bounded degree, bounded occurrences MAX2SAT, and bounded degree Node Cover. We prove also for the first time inapproximability of the problem of Sorting by Reve ..."
Abstract

Cited by 94 (17 self)
 Add to MetaCart
We prove a number of improved inaproximability results, including the best up to date explicit approximation thresholds for MIS problem of bounded degree, bounded occurrences MAX2SAT, and bounded degree Node Cover. We prove also for the first time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold. This last problem was proved only recently to be NPhard, in contrast to its signed version which is computable in polynomial time.
NEW 3/4APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM
, 1994
"... Yannakakis recently presented the first 3/4approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). His algorithm makes nontrivial use of solutions to maximum flow problems. New, simple 3/4approximation algorithms that apply the probabilistic method/randomized rounding to the solu ..."
Abstract

Cited by 70 (6 self)
 Add to MetaCart
Yannakakis recently presented the first 3/4approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). His algorithm makes nontrivial use of solutions to maximum flow problems. New, simple 3/4approximation algorithms that apply the probabilistic method/randomized rounding to the solution to a linear programming relaxation of MAX SAT are presented. It is shown that although standard randomized rounding does not give a good approximate result, the best solution of the two given by randomized rounding and a wellknown algorithm of Johnson is always within 3/4 of the optimal solution. It is further shown that an unusual twist on randomized rounding also yields 3/4approximation algorithms. As a byproduct of the analysis, a tight worstcase analysis of the relative duality gap of the linear programming relaxation is obtained.
Semidefinite Programming Relaxations For The Quadratic Assignment Problem
, 1998
"... Semidefinite programming (SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP. These relaxations result in the interesting, special, case where only the dual problem of the SDP re ..."
Abstract

Cited by 70 (24 self)
 Add to MetaCart
Semidefinite programming (SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP. These relaxations result in the interesting, special, case where only the dual problem of the SDP relaxation has strict interior, i.e. the Slater constraint qualification always fails for the primal problem. Although there is no duality gap in theory, this indicates that the relaxation cannot be solved in a numerically stable way. By exploring the geometrical structure of the relaxation, we are able to find projected SDP relaxations. These new relaxations, and their duals, satisfy the Slater constraint qualification, and so can be solved numerically using primaldual interiorpoint methods. For one of our models, a preconditioned conjugate gradient method is used for solving the large linear systems which arise when finding the Newton direction. The preconditioner is found by exploiting th...
On Lagrangian relaxation of quadratic matrix constraints
 SIAM J. Matrix Anal. Appl
, 2000
"... Abstract. Quadratically constrained quadratic programs (QQPs) play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Lagrangian relaxations often provide good approximate solutions to these hard problems. Such relaxations are equ ..."
Abstract

Cited by 45 (17 self)
 Add to MetaCart
Abstract. Quadratically constrained quadratic programs (QQPs) play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Lagrangian relaxations often provide good approximate solutions to these hard problems. Such relaxations are equivalent to semidefinite programming relaxations. For several special cases of QQP, e.g., convex programs and trust region subproblems, the Lagrangian relaxation provides the exact optimal value, i.e., there is a zero duality gap. However, this is not true for the general QQP, or even the QQP with two convex constraints, but a nonconvex objective. In this paper we consider a certain QQP where the quadratic constraints correspond to the matrix orthogonality condition XXT = I. For this problem we show that the Lagrangian dual based on relaxing the constraints XXT = I and the seemingly redundant constraints XT X = I has a zero duality gap. This result has natural applications to quadratic assignment and graph partitioning problems, as well as the problem of minimizing the weighted sum of the largest eigenvalues of a matrix. We also show that the technique of relaxing quadratic matrix constraints can be used to obtain a strengthened semidefinite relaxation for the maxcut problem. Key words. Lagrangian relaxations, quadratically constrained quadratic programs, semidefinite programming, quadratic assignment, graph partitioning, maxcut problems
A spectral algorithm for seriation and the consecutive ones problem
 SIAM Journal on Computing
, 1998
"... Abstract. In applications ranging from DNA sequencing through archeological dating to sparse matrix reordering, a recurrent problem is the sequencing of elements in such a way that highly correlated pairs of elements are near each other. That is, given a correlation function f reflecting the desire ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
Abstract. In applications ranging from DNA sequencing through archeological dating to sparse matrix reordering, a recurrent problem is the sequencing of elements in such a way that highly correlated pairs of elements are near each other. That is, given a correlation function f reflecting the desire for each pair of elements to be near each other, find all permutations π with the property that if π(i) < π(j) < π(k) then f(i, j) ≥ f(i, k) and f(j, k) ≥ f(i, k). This seriation problem is a generalization of the wellstudied consecutive ones problem. We present a spectral algorithm for this problem that has a number of interesting features. Whereas most previous applications of spectral techniques provide only bounds or heuristics, our result is an algorithm that correctly solves a nontrivial combinatorial problem. In addition, spectral methods are being successfully applied as heuristics to a variety of sequencing problems, and our result helps explain and justify these applications.
Improved Approximation Algorithms for MAX SAT
 In Proceedings of the 11th Annual ACMSIAM Symposium on Discrete Algorithms, SODA'00
, 2000
"... MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Goemans and Williamson and pr ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Goemans and Williamson and present a sharpened analysis of their performance guarantees.
Semidefinite programs and combinatorial optimization (Lecture notes)
, 1995
"... this paper, we are only concerned about the last question, which can be answered using semidefinite programming. For a survey of other aspects of such geometric representations, see [64]. ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
this paper, we are only concerned about the last question, which can be answered using semidefinite programming. For a survey of other aspects of such geometric representations, see [64].
On Some Tighter Inapproximability Results, Further Improvements
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT
, 1998
"... Improved inaproximability results are given, including the best up to date explicit approximation thresholds for bounded occurence satisfiability problems, like MAX2SAT and E2LIN2, and problems in bounded degree graphs, like MIS, Node Cover and MAX CUT. We prove also for the first time inapproxim ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Improved inaproximability results are given, including the best up to date explicit approximation thresholds for bounded occurence satisfiability problems, like MAX2SAT and E2LIN2, and problems in bounded degree graphs, like MIS, Node Cover and MAX CUT. We prove also for the first time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold for this problem.