Easy NP-hardness Proofs of Some Subset Choice Problems Full article
| Conference |
Mathematical Optimization Theory and Operations Research 06-10 Jul 2020 , Новосибирск |
||||
|---|---|---|---|---|---|
| Journal |
Communications in Computer and Information Science
ISSN: 1865-0929 |
||||
| Output data | Year: 2020, Pages: 70-79 Pages count : 10 DOI: 10.1007/978-3-030-58657-7_8 | ||||
| Tags | 2-partition; Clustering; Euclidean space; Strong np-hardness; Subset choice | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Pyatkin A.V.
Easy NP-hardness Proofs of Some Subset Choice Problems
Communications in Computer and Information Science. 2020. P.70-79. DOI: 10.1007/978-3-030-58657-7_8 Scopus OpenAlex
Easy NP-hardness Proofs of Some Subset Choice Problems
Communications in Computer and Information Science. 2020. P.70-79. DOI: 10.1007/978-3-030-58657-7_8 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85092118819 |
| OpenAlex: | W3085196264 |