• Publications
  • Influence
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least. Expand
A general approximation technique for constrained forest problems
We present a general approximation technique for a large class of graph problems, including the shortest path, minimum spanning tree, minimum-weight perfect matching, traveling salesman and Steiner tree problems. Expand
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
  • U. Feige, M. Goemans
  • Mathematics, Computer Science
  • Proceedings Third Israel Symposium on the Theory…
  • 4 January 1995
We present improved approximation algorithms for MAX 2SAT and MAX DICUT, improving upon the guarantees of 0.878 and 0.796 of Goemans and Williamson. Expand
.879-approximation algorithms for MAX CUT and MAX 2SAT
We present randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected value at least .87856 times the optimal value. Expand
New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem
Yannakakis recently presented the first $\frac{3}{4}$-approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). Expand
The primal-dual method for approximation algorithms and its application to network design problems
In the last four decades, combinatorial optimization has been strongly influenced by linear programming. Expand
An improved approximation ratio for the minimum latency problem
We develop a constant-factor approximation algorithm for theminimum latency problem, which improves the approximation ratio of the traveling salesman problem to 21%. Expand
Approximating submodular functions everywhere
We consider the problem of approximating a non-negative, monotone, submodular function f on a ground set of size n everywhere, after only poly(n) oracle queries. Expand
Semidefinite programming in combinatorial optimization
  • M. Goemans
  • Computer Science, Mathematics
  • Math. Program.
  • 1 October 1997
We discuss the use of semidefinite programming for combinatorial optimization problems. Expand
Sink equilibria and convergence
We introduce the concept of a sink equilibrium. A sink equilibrium is a strongly connected component with no outgoing arcs in the strategy profile graph associated with a game. The strategy profileExpand