BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
1 × The Netherlands
3 × USA
Collaborated with:
D.P.Williamson J.R.Correa B.C.Dean N.Olver T.Rothvoß R.Zenklusen M.Mihail V.V.Vazirani
Talks about:
approxim (5) algorithm (4) max (3) steiner (2) problem (2) cut (2) semidefinit (1) hypergraph (1) bipartit (1) advertis (1)

Person: Michel X. Goemans

DBLP DBLP: Goemans:Michel_X=

Facilitated 1 volumes:

STOC 2003Ed

Contributed to:

STOC 20122012
STOC 20042004
ICALP 20032003
STOC 20012001
STOC 19941994
STOC 19931993

Wrote 6 papers:

Matroids and integrality gaps for hypergraphic steiner tree relaxations (MXG, NO, TR, RZ), pp. 1161–1176.
STOC-2004-CorreaG #approximate #graph #theorem
An approximate König’s theorem for edge-coloring weighted bipartite graphs (JRC, MXG), pp. 398–406.
ICALP-2003-DeanG #algorithm #approximate #scheduling
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling (BCD, MXG), pp. 1138–1152.
STOC-2001-GoemansW #algorithm #approximate #problem #programming
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.
STOC-1994-GoemansW #algorithm #approximate #satisfiability
.879-approximation algorithms for MAX CUT and MAX 2SAT (MXG, DPW), pp. 422–431.
STOC-1993-WilliamsonGMV #algorithm #approximate #network #problem
A primal-dual approximation algorithm for generalized Steiner network problems (DPW, MXG, MM, VVV), pp. 708–717.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.