A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem

DOI10.1007/978-3-030-02487-1_7zbMath1480.05079OpenAlexW2912306840MaRDI QIDQ5114944

Muhammad Abid Dar, Guntram Scheithauer, John Martinovic, Andreas Fischer

Publication date: 29 June 2020

Published in: Advances in Mechanics and Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-02487-1_7

zbMATH Keywords

mixed integer linear programminggraph connectivityreduction methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Connectivity (05C40)

Related Items (1)

Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles

Cites Work

• Unnamed Item
• On the approximability and hardness of minimum topic connected overlay and its special instances
• An optimization problem on graphs
• Connectivity Inference in Mass Spectrometry Based Structure Determination
• Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
• Matroids and Subset Interconnection Design
• Two algorithms for the subset interconnection design problem
• Inferring Social Networks from Outbreaks
• An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
• Constructing scalable overlays for pub-sub with many topics
• Algorithms and Implementation for Interconnection Graph Problem

This page was built for publication: A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem