An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field - Université de Picardie Jules Verne Accéder directement au contenu
Article Dans Une Revue Lecture Notes in Networks and Systems Année : 2022

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

Fichier non déposé

Dates et versions

hal-04007822 , version 1 (28-02-2023)

Identifiants

Citer

Mhand Hifi, Shohre Sadeghsa. An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field. Lecture Notes in Networks and Systems, 2022, Lecture Notes in Networks and Systems, 283, pp.410-422. ⟨10.1007/978-3-030-80119-9_24⟩. ⟨hal-04007822⟩

Collections

U-PICARDIE EPROAD
5 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More