We prove that finding an O(n~(c_1)d~(c_2))-optimal solution to the regularized sparse optimization problem is strongly NP-hard for any c_1, c_2 ∈ [0, 1) such that c_1 + c_2 < 1. The result applies to a broad class of loss functions and sparse penalty functions. It ...
We show that if the penalty function is concave but not linear, then the optimization problem is strongly NP-hard. This result answers the complexity of many regularized optimization problems studied in the literature. It implies that it is impossible to have a fully polynomial-time approximation ...
Furthermore, we determine the boundary between polynomially solvable and NP-hard cases.doi:10.1016/j.amc.2011.12.020Rados?aw RudekElsevier Inc.Applied Mathematics & ComputationRudek R (2012) The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based ...
In general, MinLOB is NP-hard and we consider three parameterizations of MinLOB. We prove that two of them are NP-complete for every value of the parameter, but the third one is fixed-parameter tractable (FPT). The FPT parameterization is as follows: given a digraph D of order n and ...
While the problem of packing two-dimensional squares into a square, in which a set of squares is packed into a big square, has been proved to be NP-complete, the computational complexity of the d-dimensional (d > 2) problems of packing hypercubes i
Moreover, it is shown that computing this invariant is NP-hard. Related invariants for directed graphs are defined and studied. 展开 关键词: Theoretical or Mathematical/ computational complexity directed graphs/ connected digraph strong metric dimension graph vertex covering number NP-hard problem ...
aet al.(1992)Hansen, Jaumard, and Savardn (a) proved strong NP-hardness, using a reduction from KERNEL (see y and Johnson(1979)r y and Johnson(1979)a). [translate] aThere are two errors in this XML. The contract number in the first few items is not correct. 正在翻译,请等待......
Further, we also prove that for two antennae it is NP-hard to decide whether such an orientation exists if both the transmission angle and range are small for each antennae. 展开 关键词: Practical, Theoretical or Mathematical/ ad hoc networks communication complexity directed graphs directive ...
They also proved that it is NP-hard to decide whether a given point set has a perfect strong square matching. 1.2. Our results In this paper we consider the problem of computing a strong matching in GS(P), where S∈{⊖,▽,□}. In Section 2, we provide some observations and prove...
In fact, in the worst-case scenario, the computational complexity of simple algorithms scales exponentially with the number N of electrons47 and computing the SCE functional may be NP-hard.46, 48, 49 In the discrete setting, where the single particle density ρ is supported on ℓ points, ...