Skip to main content
SpringerLink
Log in

An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field

  • Conference paper
  • First Online:
Intelligent Computing

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 283))

Abstract

In this paper, we propose a new iterative randomized rounding algorithm for approximately solving the k-clustering minimum completion problem. The problem is defined in the telecommunication field where an instance of the problem is characterized by a bipartite graph G(S, C, E). S represents a set of services, C denotes a set of clients and E is a set related to the links between elements of C and S. The problem is to partition the initial graph into k-clusters such that each cluster is a complete bipartite subgraph. The goal is to minimize added edges to make a complete sub bipartite graph. The proposed algorithm is based upon two phases: (i) rounding a series of fractional variables, augmented with (ii) a constructive hill-climbing procedure. Both phases are embedded into an iterative search forming an iterative randomized search. The performance of the proposed method is evaluated on a set of benchmark instances taken from the literature. Provided bounds are compared to those reached by the best methods available in the literature. Encouraging results have been provided.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Al-Iedani, N., Hifi, M., Saadi, T.: Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem. In 2016 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 639–643. IEEE (2016)

    Google Scholar 

  2. Ali Saleh, S., Hifi, M.: A fast method for optimizing the K-clustering bi-clique completion problem in telecommunication. J. Duhok Univ. 175–183 (2017)

    Google Scholar 

  3. Faure, N., Chrétienne, P., Gourdin, E., Sourd, F.: Biclique completion problems for multicast network design. Discret. Optim. 4(3–4), 360–377 (2007)

    Article  MathSciNet  Google Scholar 

  4. Hifi, M., Moussa, I., Saadi, T., Saleh, S.: An adaptive neighborhood search for k-clustering minimum bi-clique completion problems. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. 15–25. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18161-5_2

    Chapter  Google Scholar 

  5. Gualandi, S., Maffioli, F., Magni, C.: A branch and price approach to k-Clustering minimum biclique completion problem. Int. Trans. Oper. Res. 20(1), 101–117 (2013)

    Article  MathSciNet  Google Scholar 

  6. Gualandi, S.: k-klustering minimum biclique completion via a hybrid CP and SDP approach. In: van Hoeve, W.-J., Hooker, J.N. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. LNCS, vol. 5547, pp. 87–101. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01929-6_8

    Chapter  MATH  Google Scholar 

  7. Hifi, M., Sadeghsa, S.: Adaptation of the rounding search-based algorithm for the k-clustering minimum completion problem, In: IEEE, the 7th International Conference on Control, Decision and Information Technologies (CoDIT), Prague, Czech Republic, pp. 1150–1155 (2020). https://doi.org/10.1109/CoDIT49905.2020.9263846

  8. Hifi, M.: An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem. Eng. Optim. 46(8), 1109–1122 (2014)

    Article  MathSciNet  Google Scholar 

  9. Duginov, O.: On the complexity of the clustering minimum Biclique completion problem (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EPROAD EA 4669, Université de Picardie Jules Verne, 7 rue du Moulin Neuf, 80000, Amiens, France

    Mhand Hifi & Shohre Sadeghsa

Authors
  1. Mhand Hifi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shohre Sadeghsa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mhand Hifi .

Editor information

Editors and Affiliations

  1. Faculty of Science and Engineering, Saga University, Saga, Japan

    Kohei Arai

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hifi, M., Sadeghsa, S. (2022). An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field. In: Arai, K. (eds) Intelligent Computing. Lecture Notes in Networks and Systems, vol 283. Springer, Cham. https://doi.org/10.1007/978-3-030-80119-9_24

Download citation

Publish with us

Policies and ethics

Search

Navigation