Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem
From MaRDI portal
Publication:1926502
DOI10.1016/j.disopt.2012.05.002zbMath1254.90278OpenAlexW1986446280MaRDI QIDQ1926502
Ruonan Zhang, Abraham P. Punnen
Publication date: 28 December 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.05.002
Related Items (1)
Cites Work
This page was built for publication: Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem