OFFSET
0,1
COMMENTS
Goemans and Williamson: There is a polynomial-time algorithm that, given as input a graph G=(V,E), finds a bipartition that cuts at least alpha_GW*opt edges, where opt is the number of edges cut by an optimal bipartition of G (from p. 97 of Trevisan).
On the Unique Games Conjecture, a Turing machine can approximate the Max Cut problem in polynomial time with a better approximation ratio if and only if P = NP. - Charles R Greathouse IV, Mar 06 2014
LINKS
M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, JACM 42 (1995), no. 6, 1115-1145.
L. Trevisan, On Khot's unique games conjecture, Bull. Amer. Math. Soc. 49 (2012), 91-111.
FORMULA
alpha_GW = min_{1/2 < rho < 1} 1/Pi * arccos(1-2*rho)/rho.
EXAMPLE
0.878567205784851604217301...
MAPLE
nmax:= 105: Digits:= nmax+15:
f:= rho-> arccos(1-2*rho)/(Pi*rho):
s:= convert(evalf(f(fsolve(D(f)(x), x=1/2..1))), string):
seq(parse(s[n+1]), n=1..nmax); # Alois P. Heinz, Jan 08 2012
MATHEMATICA
digits = 105; FindMinimum[1/Pi*ArcCos[1-2*rho]/rho, {rho, 4/5}, WorkingPrecision -> digits+1] // First // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Feb 20 2014 *)
PROG
(PARI) (x->2*x/(Pi*(1-cos(x))))(solve(x=2, 3, x*sin(x)+cos(x)-1)) \\ Charles R Greathouse IV, Mar 06 2014
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Jonathan Vos Post, Jan 07 2012
STATUS
approved