Aprile, M., Drescher, M., Fiorini, S., & Huynh, T. (2023). A tight approximation algorithm for the cluster vertex deletion problem. Mathematical programming, 197(2), 1069-1091. https://doi.org/10.1007/s10107-021-01744-w
Chicago Style (17th ed.) CitationAprile, Manuel, Matthew Drescher, Samuel Fiorini, and Tony Huynh. "A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem." Mathematical Programming 197, no. 2 (2023): 1069-1091. https://doi.org/10.1007/s10107-021-01744-w.
MLA (9th ed.) CitationAprile, Manuel, et al. "A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem." Mathematical Programming, vol. 197, no. 2, 2023, pp. 1069-1091, https://doi.org/10.1007/s10107-021-01744-w.
Warning: These citations may not always be 100% accurate.