Efficient algorithms for cluster editing-Reference-Cited by-同舟云学术

Efficient algorithms for cluster editing

Published:2014-05-18 Issue:1 Volume:31 Page:347-371
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Bastos Lucas,Ochi Luiz Satoru,Protti Fábio,Subramanian Anand,Martins Ivan César,Pinheiro Rian Gabriel S.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-014-9756-7.pdf

Reference30 articles.

1. Aiex RM, Binato S, Resende MGC (2003) Parallel grasp with path-relinking for job shop scheduling. Parallel Comput 29:393–430

2. Bastos LO (2012) Novos algoritmos e resultados teóricos para o problema de particionamento de grafos por edição de arestas. PhD thesis, Universidade Federal Fluminense (in Portuguese)

3. Baumbach J, Emig D, Kleinbolting N, Lange S, Rahmann S, Wittkop T (2014) TransClust. http://transclust.mmci.uni-saarland.de/main_page/index.php, Accessed January 28, 2014

4. Ben-Dor A, Shamir R, Yakhini Z (1999) Clustering gene expression patterns. J Comput Biol 6(3/4):281–297

5. Böcker S, Briesemeister B, A QB, Truss A (2008) Going weighted: parameterized algorithms for cluster editing. Comb Optim Appl 5165:1–12

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An integrated ILS-VND strategy for solving the knapsack problem with forfeits;Journal of Heuristics;2024-08-06

2. Cluster Editing;Encyclopedia of Optimization;2022-09-21

3. Conference scheduling: A clustering-based approach;European Journal of Operational Research;2022-02

4. Recent Advances in Practical Data Reduction;Lecture Notes in Computer Science;2022

5. Polyhedral properties of the induced cluster subgraphs;Discrete Applied Mathematics;2021-07