IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/vyid10.1007_s10878-020-00612-1.html
   My bibliography  Save this article

Approximation algorithms for two variants of correlation clustering problem

Author

Listed:
  • Sai Ji

    (Beijing University of Technology)

  • Dachuan Xu

    (Beijing University of Technology)

  • Min Li

    (Shandong Normal University)

  • Yishui Wang

    (Chinese Academy of Sciences)

Abstract

Correlation clustering problem is a clustering problem which has many applications such as protein interaction networks, cross-lingual link detection, communication networks, and social computing. In this paper, we introduce two variants of correlation clustering problem: correlation clustering problem on uncertain graphs and correlation clustering problem with non-uniform hard constrained cluster sizes. Both problems overcome part of the limitations of the existing variants of correlation clustering problem and have practical applications in the real world. We provide a constant approximation algorithm and two approximation algorithms for the former and the latter problem, respectively.

Suggested Citation

  • Sai Ji & Dachuan Xu & Min Li & Yishui Wang, 0. "Approximation algorithms for two variants of correlation clustering problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
    • Handle: RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00612-1
    DOI: 10.1007/s10878-020-00612-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00612-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-020-00612-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Min Li & Dachuan Xu & Dongmei Zhang & Tong Zhang, 2019. "A Streaming Algorithm for k-Means with Approximate Coreset," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(01), pages 1-18, February.
    2. Anke van Zuylen & David P. Williamson, 2009. "Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 594-620, August.
    3. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sai Ji & Dachuan Xu & Min Li & Yishui Wang, 2022. "Approximation algorithms for two variants of correlation clustering problem," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 933-952, July.
    2. Andrea Aveni & Ludovico Crippa & Giulio Principi, 2024. "On the Weighted Top-Difference Distance: Axioms, Aggregation, and Approximation," Papers 2403.15198, arXiv.org, revised Mar 2024.
    3. Hu, Xiaoxuan & Zhu, Waiming & Ma, Huawei & An, Bo & Zhi, Yanling & Wu, Yi, 2021. "Orientational variable-length strip covering problem: A branch-and-price-based algorithm," European Journal of Operational Research, Elsevier, vol. 289(1), pages 254-269.
    4. Chenchen Wu & Donglei Du & Yue Kang, 0. "An approximation algorithm for stochastic multi-level facility location problem with soft capacities," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    5. Yanjun Jiang & Dachuan Xu & Donglei Du & Chenchen Wu & Dongmei Zhang, 2018. "An approximation algorithm for soft capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 493-511, February.
    6. Faiz, Tasnim Ibn & Noor-E-Alam, Md, 2019. "Data center supply chain configuration design: A two-stage decision approach," Socio-Economic Planning Sciences, Elsevier, vol. 66(C), pages 119-135.
    7. Lu Han & Dachuan Xu & Donglei Du & Dongmei Zhang, 2018. "A local search approximation algorithm for the uniform capacitated k-facility location problem," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 409-423, February.
    8. Stergios Athanassoglou, 2013. "Robust Multidimensional Welfare Comparisons: One Vector of Weights, One Vote," Working Papers 2013.40, Fondazione Eni Enrico Mattei.
    9. Huizhen Zhang & Cesar Beltran-Royo & Bo Wang & Ziying Zhang, 2019. "Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce," Computational Optimization and Applications, Springer, vol. 72(3), pages 827-848, April.
    10. Athanassoglou, Stergios, 2013. "Multidimensional welfare rankings," MPRA Paper 51642, University Library of Munich, Germany.
    11. Haris Aziz & Hau Chan & Barton E. Lee & Bo Li & Toby Walsh, 2019. "Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives," Papers 1911.09813, arXiv.org.
    12. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2015. "Multi-level facility location as the maximization of a submodular set function," European Journal of Operational Research, Elsevier, vol. 247(3), pages 1013-1016.
    13. Manuel Lafond, 2024. "Improved kernelization and fixed-parameter algorithms for bicluster editing," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-27, July.
    14. Chenchen Wu & Donglei Du & Yue Kang, 2022. "An approximation algorithm for stochastic multi-level facility location problem with soft capacities," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1680-1692, October.
    15. Lai, Xiaofan & Xu, Zhou, 2016. "Improved algorithms for joint optimization of facility locations and network connections," European Journal of Operational Research, Elsevier, vol. 250(3), pages 745-753.
    16. Stergios Athanassoglou, 2015. "Multidimensional welfare rankings under weight imprecision: a social choice perspective," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(4), pages 719-744, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00612-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.