Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 5 January 2021Accepted: 30 August 2021Published online: 10 February 2022KeywordsWasserstein barycenters, optimal transport NP-hardness, inapproximability, computational complexity, curse dimensionalityAMS Subject Headings68Q17, 90C08Publication DataISSN (online): 2577-018...