Nimbhorkar, and K. Varadarajan, “The Planar k -Means Problem Is NP-Hard,” Lect. Notes Comput. Sci. 5431 , 284–285 (2009).M. Mahajan, P. Nimbhorkar, and K. Varadarajan, "The Planar k- Means Problem is NP-Hard," Lecture Notes in Computer Science, vol. 5431, pp. 274-285, ...
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 for...
In the Determinant Maximization problem, given an positive semi-definite matrix in and an integer k, we are required to find a principal submatrix of having the maximum determinant. This problem is known to be NP-hard and further proven to be W[1]-hard with respect to k by Koutis (Inf...
The JADE experiment was one of five large detector systems taking data at the electron–positron collider PETRA, from 1979 to 1986, at $$e^+e^-$$ anni
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
Despite rapid advances in both algorithms and digital computer technology, even modest sized NP-hard/NP-complete problems that arise in practice may be very difficult to solve on modern digital computers. One alternative to current von-Neumann-computer-based methods for solving such problems is a ...
This classical problem has been studied extensively and in many variations. Most of the variations concern restrictions of the weight function. One of the most natural restrictions is to assume that the weight function is a metric. Intuitively this means that we are allowed to take the shortest ...
cardinality such that no two vertices in the subset are directly connected. Generally, MIS is NP-hard, but its approximation is possible on planar graphs. In particular, we consider an undirected graph\(G=(V,E)\)with\(|V|=n\). An integer programming formulation for MIS problem takes the...
It is likely that, if such a discovery (i.e., a discovery con- nected to Higgs interactions) will happen, it will be through the combination of electroweak precision data with Higgs physics [13]. This means, on the one hand, controlling the general features of electroweak symmetry ...