Hostname: page-component-7479d7b7d-t6hkb Total loading time: 0 Render date: 2024-07-11T12:56:38.777Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  25 October 2010

Elisabeth Gassner
Elisabeth Gassner*
Affiliation:
Department of Optimization and Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010 Graz, Austria. gassner@opt.math.tu-graz.ac.at
Get access

Abstract

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.

Keywords

Partial inverse minimum cut problem
Type
Research Article
Information
RAIRO - Operations Research , Volume 44 , Issue 3 , July 2010 , pp. 241 - 249
Copyright
© EDP Sciences, ROADEF, SMAI, 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ahuja, R.K. and Orlin, J.B., Inverse optimization. Oper. Res. 49 (2001) 771–783. CrossRef
Ford, L.R., Jr. and D.R. Fulkerson, Maximal flow through a network. Canad. J. Math. 8 (1956) 399–404. CrossRef
Garey, M.R., Johnson, D.S. and Stockmeyer, L., Some simplified NP-complete graph problems. Theor. Comput. Sci. 1 (1976) 237–267. CrossRef
Heuberger, C., Inverse combinatorial optimization: a survey on problems, methods, and results. J. Comb. Optim. 8 (2004) 329–361. CrossRef
T.C. Lai and J.B. Orlin, The complexity of preprocessing. Research Report of Sloan School of Management, MIT (2003).
J.B. Orlin, Partial inverse optimization problems. Working paper, Sloan School of Management, MIT.
Yang, X., Complexity of partial inverse assignment problem and partial inverse cut problem. RAIRO-Oper. Res. 35 (2001) 117–126. CrossRef
Zhang, J. and Cai, M.-C., Inverse problem of minimum cuts. Math. Methods Oper. Res. 47 (1998) 51–58. CrossRef