What is it about?
The Minimum Connectivity Inference problem is an NP-hard discrete optimization problem. Its description is based on a graph. We have presented a computational study on the influence of several reduction techniques, including a heuristic one, on the problem size and the computation time of a flow based solution algorithm.
Featured Image
Why is it important?
This contribution gives an overview of the properties and effectiveness of a heuristic reduction rule.
Perspectives
This work is one of the articles that I produced together with my research group at Technische Universität Dresden during my PhD. It includes extensive computational experimentation on the effect of an exact solution algorithm for the Minimum Connectivity Inference problem.
Dr Muhammad Abid Dar
University of Gujrat
Read the Original
This page is a summary of: A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem, January 2019, Springer Science + Business Media,
DOI: 10.1007/978-3-030-02487-1_7.
You can read the full text:
Contributors
The following have contributed to this page
