Volume 44, Number 3, July-September 2010
|Page(s)||241 - 249|
|Published online||25 October 2010|
The partial inverse minimum cut problem with L1-norm is strongly NP-hard
Department of Optimization and Discrete
Mathematics, Graz University of Technology, Steyrergasse 30, 8010 Graz, Austria. firstname.lastname@example.org
Accepted: 7 August 2010
The partial inverse minimum cut problem is to minimally modify the capacities of a digraph such that there exists a minimum cut with respect to the new capacities that contains all arcs of a prespecified set. Orlin showed that the problem is strongly NP-hard if the amount of modification is measured by the weighted L1-norm. We prove that the problem remains hard for the unweighted case and show that the NP-hardness proof of Yang [RAIRO-Oper. Res. 35 (2001) 117–126] for this problem with additional bound constraints is not correct.
Mathematics Subject Classification: 90C27 / 90C60 / 68Q25
Key words: Partial inverse minimum cut problem
© EDP Sciences, ROADEF, SMAI, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.