Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Feige, Uriel
and
Schechtman, Gideon
2001.
On the integrality ratio of semidefinite relaxations of MAX CUT.
p.
433.
Alon, Noga
Sudakov, Benny
and
Zwick, Uri
2001.
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms.
SIAM Journal on Discrete Mathematics,
Vol. 15,
Issue. 1,
p.
58.
Lewin, Michael
Livnat, Dror
and
Zwick, Uri
2002.
Integer Programming and Combinatorial Optimization.
Vol. 2337,
Issue. ,
p.
67.
Feige, Uriel
and
Schechtman, Gideon
2002.
On the optimality of the random hyperplane rounding technique for MAX CUT.
Random Structures & Algorithms,
Vol. 20,
Issue. 3,
p.
403.
Rozenman, Eyal
and
Vadhan, Salil
2005.
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques.
Vol. 3624,
Issue. ,
p.
436.
Reingold, Omer
2005.
Undirected ST-connectivity in log-space.
p.
376.
Laurent, Monique
and
Rendl, Franz
2005.
Discrete Optimization.
Vol. 12,
Issue. ,
p.
393.
Cioabă, Sebastian M.
Gregory, David A.
and
Nikiforov, Vladimir
2007.
Extreme eigenvalues of nonregular graphs.
Journal of Combinatorial Theory, Series B,
Vol. 97,
Issue. 3,
p.
483.
Xu, Da-chuan
and
Zhang, Shu-zhong
2007.
Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation.
Science in China Series A: Mathematics,
Vol. 50,
Issue. 11,
p.
1583.
Reingold, Omer
2008.
Undirected connectivity in log-space.
Journal of the ACM,
Vol. 55,
Issue. 4,
p.
1.
O'Donnell, Ryan
and
Wu, Yi
2008.
An optimal sdp algorithm for max-cut, and equally optimal long code tests.
p.
335.
Ben‐Ameur, Walid
and
Neto, José
2008.
Spectral bounds for the maximum cut problem.
Networks,
Vol. 52,
Issue. 1,
p.
8.
Trevisan, Luca
2009.
Max cut and the smallest eigenvalue.
p.
263.
Shi, Lingsheng
2009.
The spectral radius of irregular graphs.
Linear Algebra and its Applications,
Vol. 431,
Issue. 1-2,
p.
189.
Bramoulle, Yann
Kranton, Rachel
and
D'Amours, Martin
2010.
Strategic Interaction and Networks.
SSRN Electronic Journal,
Trevisan, Luca
2012.
Max Cut and the Smallest Eigenvalue.
SIAM Journal on Computing,
Vol. 41,
Issue. 6,
p.
1769.
Dumer, Ilya
and
Kapralova, Olga
2012.
Spherically punctured biorthogonal codes.
p.
259.
Dumer, Ilya
and
Kapralova, Olga
2013.
Spherically Punctured Biorthogonal Codes.
IEEE Transactions on Information Theory,
Vol. 59,
Issue. 9,
p.
6010.
2013.
Spectral Clustering and Biclustering.
p.
44.
Ekambaram, Venkatesan N
Fanti, Giulia
Ayazifar, Babak
and
Ramchandran, Kannan
2013.
Critically-sampled perfect-reconstruction spline-wavelet filterbanks for graph signals.
p.
475.