3 citations · 3 across the 1 of their papers we have counts for
4 papers
Complex Semidefinite Programming and Max-k-Cut
Alantha Newman
In a second seminal paper on the application of semidefinite programming to graph partitioning problems, Goemans and Williamson showed how to formulate and round a complex semidefi…
Rounding semidefinite programs for large-domain problems via Brownian motion
Kevin L. Chang, Alantha Newman
We present a new simple method for rounding a semidefinite programming relaxation of a constraint satisfaction problem. We apply it to the problem of approximate angular synchroniz…
Explicit 3-colorings for exponential graphs
Adrien Argento, Pierre Charbit, Alantha Newman
For a graph and integer , two functions from into are adjacent if for all edges of , . The graph of all such f…
A counterexample to Beck's conjecture on the discrepancy of three permutations
Alantha Newman, Aleksandar Nikolov
Given three permutations on the integers 1 through n, consider the set system consisting of each interval in each of the three permutations. Jozsef Beck conjectured (c. 1987) that…