A spectral partitioning algorithm for maximum directed cut problem

Zhenning Zhang, Donglei Du, Chenchen Wu, Dachuan Xu and Dongmei Zhang ()
Additional contact information
Zhenning Zhang: Beijing University of Technology
Donglei Du: University of New Brunswick
Chenchen Wu: Tianjin University of Technology
Dachuan Xu: Beijing University of Technology
Dongmei Zhang: Shandong Jianzhu University

Journal of Combinatorial Optimization, 2021, vol. 42, issue 3, No 4, 373-395

Abstract: Abstract We investigate the maximum directed cut (MaxDC) problem by designing a spectral partitioning algorithm. Given a directed graph with nonnegative arc weights, we wish to obtain a bipartition of the vertices such that the total weight of the directed cut arcs is maximized. Relaxing the MaxDC problem as a quadratic program allows us to explore combinatorial properties of the optimal solution, leading to a 0.272-approximation algorithm via the technique of spectral partitioning rounding.

Keywords: Maximum directed cut; Spectral graph theory; Spectral partitioning rounding; Approximation algorithm (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0369-4 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:42:y:2021:i:3:d:10.1007_s10878-018-0369-4

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

DOI: 10.1007/s10878-018-0369-4

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 ().