The partial inverse minimum cut problem with L₁-norm is strongly NP-hard

E-ISSN： 1290-3868|44|3|241-249

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.44, Iss.3, 2010-10, pp. : 241-249

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Complexity of Partial Inverse Assignment Problem and PartialInverse Cut Problem

By Yang Xiaoguang

RAIRO - Operations Research, Vol. 35, Iss. 1, 2010-03 ,pp. : 117-126

Edp Sciences

Access to resources Recommend Favorite

The inverse maximum flow problem considering l_∞ norm

By Deaconu Adrian

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 401-414

Edp Sciences

Access to resources Recommend Favorite

Differential approximation of NP-hard problems with equal size feasible solutions

By Monnot Jérôme

RAIRO - Operations Research, Vol. 36, Iss. 4, 2010-03 ,pp. : 279-297

Edp Sciences

Access to resources Recommend Favorite

On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem

By Mishra Sounaka Sikdar Kripasindhu

RAIRO - Theoretical Informatics and Applications, Vol. 35, Iss. 3, 2010-03 ,pp. : 287-309

Edp Sciences

Access to resources Recommend Favorite

Inverse Scattering Problem with Underdetermined Data

Mathematical Modelling of Natural Phenomena , Vol. 9, Iss. 5, 2014-07 ,pp. : 244-253

Edp Sciences

Access to resources Recommend Favorite