Exact algorithms for cluster editing: Evaluation and experiments
From MaRDI portal
Publication:534775
DOI10.1007/s00453-009-9339-7zbMath1215.68169MaRDI QIDQ534775
Sebastian Böcker, Sebastian Briesemeister, Gunnar W. Klau
Publication date: 10 May 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/14843
branch-and-cut algorithm; integer linear programming; ILP; computer experiments; cluster editing; fixed-parameter tractability; NP-complete problem; FPT; algorithm engineering
90C10: Integer programming
68W05: Nonnumerical algorithms
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
68R10: Graph theory (including graph drawing) in computer science