An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems

Chenchen Wu, Donglei Du and Dachuan Xu ()
Additional contact information
Chenchen Wu: Beijing University of Technology
Donglei Du: University of New Brunswick
Dachuan Xu: Beijing University of Technology

Journal of Combinatorial Optimization, 2015, vol. 29, issue 1, No 4, 53-66

Abstract: Abstract We present a unified semidefinite programming hierarchies rounding approximation algorithm for a class of maximum graph bisection problems with improved approximation ratios. Under the above algorithmic framework, we show that the approximation ratios of Max- $$\frac{n}{2}$$ n 2 -cut, Max- $$\frac{n}{2}$$ n 2 -dense-subgraph, and Max- $$\frac{n}{2}$$ n 2 -vertex-cover are equal to those of Max- $$\frac{n}{2}$$ n 2 -uncut, Max- $$\frac{n}{2}$$ n 2 -directed-cut, and Max- $$\frac{n}{2}$$ n 2 -directed-uncut, respectively.

Keywords: Semidefinite programming hierarchies; Approximation algorithm; Rounding; Graph bisection problems (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9673-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:1:d:10.1007_s10878-013-9673-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9673-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().