Constraint Generation Algorithm for the Minimum Connectivity Inference Problem
Given a hypergraph H, the Minimum Connectivity Inference problem asks for a graph on the same vertex set as H with the minimum number of edges such that the subgraph induced by every hyperedge of H is connected. This problem has received a lot of attention these recent years, both from a theoretical and practical perspective, leading to several implemented approximation, greedy and heuristic algorithms. Concerning exact algorithms, only Mixed Integer Linear Programming (MILP) formulations have been experimented, all representing connectivity constraints by the means of graph flows. In this work, we investigate the efficiency of a constraint generation algorithm, where we iteratively add cut constraints to a simple ILP until a feasible (and optimal) solution is found. It turns out that our method is faster than the previous best flow-based MILP algorithm on random generated instances, which suggests that a constraint generation approach might be also useful for other optimization problems dealing with connectivity constraints. At last, we present the results of an enumeration algorithm for the problem.
KeywordsHypergraph Constraint generation algorithm Connectivity problem
We would like to thank Muhammad Abid Dar, Andreas Fischer, John Martinovic and Guntram Scheithauer for providing us the source code of their algorithm .
- 1.Agarwal, D., Araujo, J.-C.S., Caillouet, C., Cazals, F., Coudert, D., Pérennes, S.: Connectivity inference in mass spectrometry based structure determination. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 289–300. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40450-4_25CrossRefGoogle Scholar
- 7.Chockler, G., Melamed, R., Tock, Y., Vitenberg, R.: Constructing scalable overlays for pub-sub with many topics. In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 109–118 (2007)Google Scholar
- 8.Conitzer, V., Derryberry, J., Sandholm, T.: Combinatorial auctions with structured item graphs. In: Proceedings of the 19th National Conference on Artifical Intelligence, AAAI 2004, pp. 212–218 (2004)Google Scholar
- 9.Dar, M.A., Fischer, A., Martinovic, J., Scheithauer, G.: A computational study of reduction techniques for the minimum connectivity inference problem. In: Singh, V.K., Gao, D., Fischer, A. (eds.) Advances in Mathematical Methods and High Performance Computing. AMM, vol. 41, pp. 135–148. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-02487-1_7CrossRefGoogle Scholar
- 19.Onus, M., Richa, A.W.: Minimum maximum degree publish-subscribe overlay network design. In: IEEE INFOCOM 2009, pp. 882–890 (2009)Google Scholar