Reduction of Maximum Flow Network Interdiction Problem from The Clique Problem
Data Structures and Algorithms
2014-02-11 v1 Optimization and Control
Abstract
Maximum Flow Network Interdiction Problem (MFNIP) is known to be strongly NP-hard problem. We solve a simple form of MFNIP in polynomial time. We review the reduction of MFNIP from the clique problem. We propose a polynomial time solution to the Clique Problem.
Cite
@article{arxiv.1402.2022,
title = {Reduction of Maximum Flow Network Interdiction Problem from The Clique Problem},
author = {Pawan Tamta and Bhagwati Prasad Pande and H. S Dhami},
journal= {arXiv preprint arXiv:1402.2022},
year = {2014}
}
Comments
10 pages,3 figures. arXiv admin note: substantial text overlap with arXiv:1312.6492