Indexed by:
Abstract:
We present a unified semidefinite programming hierarchies rounding approximation algorithm for a class of maximum graph bisection problems with improved approximation ratios. © 2013 Springer-Verlag Berlin Heidelberg.
Keyword:
Reprint Author's Address:
Email:
Source :
ISSN: 0302-9743
Year: 2013
Volume: 7936 LNCS
Page: 304-315
Language: English
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 2
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 8
Affiliated Colleges: