Back to Search
Start Over
K-cluster combinatorial optimization problems is NP_Hardness problem in graph clustering.
- Source :
-
AIP Conference Proceedings . 10/25/2022, Vol. 2398 Issue 1, p1-10. 10p. - Publication Year :
- 2022
-
Abstract
- This manuscript introduces a valid strategy to prove the optimization problem is the NP_Hardness problem. First of all, K-cluster is one of the most important NP-hardness problems of combinatorial optimization problems. Secondly, a problem is hard if it cannot be solved by a feasible (polynomial time) algorithm; i.e. the hard problem cannot be solved in particular. Furthermore, the strategy of this paper is to use a technique to show the problem is NP-Hard. Finally, the problem is NP-Hard if every problem from NP can be reduced to that which is means reductions proven. [ABSTRACT FROM AUTHOR]
- Subjects :
- *POLYNOMIAL time algorithms
*NP-hard problems
*HARDNESS
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 0094243X
- Volume :
- 2398
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- AIP Conference Proceedings
- Publication Type :
- Conference
- Accession number :
- 159872668
- Full Text :
- https://doi.org/10.1063/5.0093394