Pages that link to "Item:Q418776"
From MaRDI portal
The following pages link to On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776):
Displaying 7 items.
- Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances'' (Q476920) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
- A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem (Q5114944) (← links)
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem (Q5197998) (← links)
- Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) (← links)
