The planar K-means prob- lem is NP-hard. In Proceedings of the 3rd International Workshop on Algorithms and Compu- tation (WALCOM '09), pages 274-285. Springer-Verlag, 2009.M. Mahajan, P. Nimbhorkar, and K. Varadarajan, "The planar k-means problem is np-hard," in WALCOM: ...
Double k-means Clustering for Simultaneous Classification of Objects and Variables The identification of the model is obtained by the numerical solution of a least-squares problem, which is typically NP-hard. An alternating least-squares... V Maurizio - Springer Berlin Heidelberg 被引量: 88发表: ...
aOn planar graphs, we prove the problem is NP-hard in general, but solvable in linear time for fided k. 在平面图表,我们证明问题一般来说,是NP坚硬的,但可解在线性时刻为fixed k。 [translate] 英语翻译 日语翻译 韩语翻译 德语翻译 法语翻译 俄语翻译 阿拉伯语翻译 西班牙语翻译 葡萄牙语翻译 ...
aOn planar graphs, we prove the problem is NP-hard in general, but solvable in linear time for fided k. 在平面图表,我们证明问题一般来说,是NP坚硬的,但可解在线性时刻为fixed k。 [translate] aOn planar graphs, we prove the problem is NP-hard in general, but solvable in linear time ...
Despite the significance of planar graphs, it has not been known whether the Planar Separator Problem, which considers a planar graph and a threshold as an input, is NP-complete or not. In this paper, we prove that the Vertex Separator Problem is in fact NP -complete when $G$ is a ...
Quantum networks will allow to implement communication tasks beyond the reach of their classical counterparts. A pressing and necessary issue for the design of quantum network protocols is the quantification of the rates at which these tasks can be perfo
(1981) shows how to design the optimal auction with exogenous signals. We show that the problem becomes NP-hard when the seller also has the ability to design the signal structures. Our main result is a polynomial-time approximation scheme (PTAS) for computing the optimal joint design with ...
aIn Section 3, we study the problem for planar graphs, and show that STC for planar graphs is NP-complete, and k-STC for planar graphs is solvable in linear time. 在第3部分,我们学习问题为平面图表,并且表示, STC为平面图表是NP完全的,并且kSTC为平面图表是可解的在线性时间。[translate]...
The any language supports uniformly-sampled random planar graphs:linkparser> asdf qwer tyuiop fghj bbb Found 1162 linkages (1162 had no P.P. violations) +---ANY---+---ANY---+ +---ANY--+--ANY--+ +---ANY--+--ANY--+ | | | | | | LEFT-WALL asdf[!] qwer[!] tyuiop[!] ...
The classical location problem is a special instance of the round-trip and one-way location problems, where every customer also coincides with a depot. When the number p of servers is an arbitrary positive integer, the classical p-center and p-median problems on general graphs are NP-hard [...