2022
DOI: 10.11591/ijece.v12i2.pp2058-2065
|View full text |Cite
|
Sign up to set email alerts
|

An analysis between exact and approximate algorithms for the k-center problem in graphs

Abstract: <span lang="EN-US">This research focuses on the k-center problem and its applications. Different methods for solving this problem are analyzed. The implementations of an exact algorithm and of an approximate algorithm are presented. The source code and the computation complexity of these algorithms are presented and analyzed. The multitasking mode of the operating system is taken into account considering the execution time of the algorithms. The results show that the approximate algorithm finds solutions… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 22 publications
(26 reference statements)
0
2
0
Order By: Relevance
“…Distinct aspects of the problem use various techniques [11]- [13], algorithms [14], [15] and approaches [16], [17]. Other algorithms and approaches are used to solve similar problems in graphs [18], [19]. Other in-depth analyses of this problem are presented in [20]- [22].…”
Section: Introductionmentioning
confidence: 99%
“…Distinct aspects of the problem use various techniques [11]- [13], algorithms [14], [15] and approaches [16], [17]. Other algorithms and approaches are used to solve similar problems in graphs [18], [19]. Other in-depth analyses of this problem are presented in [20]- [22].…”
Section: Introductionmentioning
confidence: 99%
“…Different variants use different approaches [19], [20], techniques [21], [22] and algorithms [23], [24]. Similar approaches have been used to solve other problems in graph theory [25]. Detailed reviews of the specifics of the graph vertex coloring problem are discussed in [26], [27].…”
Section: Introductionmentioning
confidence: 99%