The partial inverse minimum cut problem with L1-norm is strongly NP-hard
RAIRO-Oper. Res., 44 3 (2010) 241-249
Published online: 2010-10-25
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Partial Inverse Minimum Spanning Tree with Constant Total Weight under the Bottleneck Hamming Distance
Ji Li, Xian-Yue Li, Hao-Ran Wu and Yu-Hong ShiJournal of the Operations Research Society of China (2025)
https://doi.org/10.1007/s40305-025-00608-w
Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased
Eva Ley and Maximilian MerkertJournal of Global Optimization 93 (1) 263 (2025)
https://doi.org/10.1007/s10898-025-01529-x
Partial inverse min–max spanning tree problem under the weighted bottleneck hamming distance
Qingzhen Dong, Xianyue Li and Yu YangJournal of Combinatorial Optimization 46 (4) (2023)
https://doi.org/10.1007/s10878-023-01093-8
Partial inverse maximum spanning tree problem under the Chebyshev norm
Xianyue Li, Ruowang Yang, Heping Zhang and Zhao ZhangJournal of Combinatorial Optimization 44 (5) 3331 (2022)
https://doi.org/10.1007/s10878-022-00903-9
Power system structure optimization based on reinforcement learning and sparse constraints under DoS attacks in cloud environments
Zhiqin Zhu, Fancheng Zeng, Guanqiu Qi, Yuanyuan Li, Hou Jie and Neal MazurSimulation Modelling Practice and Theory 110 102272 (2021)
https://doi.org/10.1016/j.simpat.2021.102272
Combinatorial Optimization and Applications
Xianyue Li, Ruowang Yang, Heping Zhang and Zhao ZhangLecture Notes in Computer Science, Combinatorial Optimization and Applications 13135 389 (2021)
https://doi.org/10.1007/978-3-030-92681-6_31
Approximation algorithms for capacitated partial inverse maximum spanning tree problem
Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang and Ding-Zhu DuJournal of Global Optimization 77 (2) 319 (2020)
https://doi.org/10.1007/s10898-019-00852-4
Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
Xianyue Li, Xichao Shu, Huijing Huang and Jingjing BaiJournal of Combinatorial Optimization 38 (4) 1005 (2019)
https://doi.org/10.1007/s10878-019-00433-x
Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm
Xianyue Li, Zhao Zhang and Ding-Zhu DuJournal of Global Optimization 70 (3) 677 (2018)
https://doi.org/10.1007/s10898-017-0554-5
Algorithm for constraint partial inverse matroid problem with weight increase forbidden
Shuangshuang Li, Zhao Zhang and Hong-Jian LaiTheoretical Computer Science 640 119 (2016)
https://doi.org/10.1016/j.tcs.2016.06.002
Algorithms for the partial inverse matroid problem in which weights can only be increased
Zhao Zhang, Shuangshuang Li, Hong-Jian Lai and Ding-Zhu DuJournal of Global Optimization 65 (4) 801 (2016)
https://doi.org/10.1007/s10898-016-0412-x