A spectral partitioning algorithm for maximum directed cut problem

DOI10.1007/S10878-018-0369-4MaRDI QIDQ5918387zbMATH OpenOpenAlexFDO

Authors Zhenning Zhang, Donglei Du, Chenchen Wu, Dachuan Xu, Dongmei Zhang

Publication date 25 November 2021

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-018-0369-4

zbMATH Keywords

approximation algorithmmaximum directed cutspectral graph theoryspectral partitioning rounding

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A spectral partitioning algorithm for maximum directed cut problem
• Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning
• Combinatorial approximation algorithms for the maximum directed cut problem
• Max cut and the smallest eigenvalue
• scientific article; zbMATH DE number 1670527

Cites work

• scientific article; zbMATH DE number 2086914 (Why is no real title available?)
• scientific article; zbMATH DE number 3296475 (Why is no real title available?)
• Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Max k-cut and the smallest eigenvalue
• Max cut and the smallest eigenvalue
• Oblivious algorithms for the maximum directed cut problem

Cited in

(7)

• Efficient algorithm for optimizing spectral partitions
• Oblivious algorithms for the maximum directed cut problem
• Combinatorial approximation algorithms for the maximum directed cut problem
• Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning
• Max cut and the smallest eigenvalue
• Max CUT and the smallest eigenvalue
• A spectral partitioning algorithm for maximum directed cut problem

This page was built for publication: A spectral partitioning algorithm for maximum directed cut problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918387)