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

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

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

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

We develop a constant-factor approximation algorithm for theminimum latency problem, which improves the approximation ratio of the traveling salesman problem to 21%.Expand

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

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 profile… Expand