The maximum independent union of cliques problem: complexity and exact approaches
Crossref DOI link: https://doi.org/10.1007/s10898-018-0694-2
Published Online: 2018-08-07
Published Print: 2020-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ertem, Zeynep
Lykhovyd, Eugene
Wang, Yiming
Butenko, Sergiy http://orcid.org/0000-0002-6662-9552
Funding for this research was provided by:
National Science Foundation
Office of Naval Research
Text and Data Mining valid from 2018-08-07
Version of Record valid from 2018-08-07
Article History
Received: 18 March 2018
Accepted: 26 July 2018
First Online: 7 August 2018