Pages that link to "Item:Q5401399"

The following pages link to Constructing scalable overlays for pub-sub with many topics (Q5401399):

Displayed 11 items.

• On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) ‎ (← 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)
• Confidential gossip (Q2204776) ‎ (← links)
• Network construction with subgraph connectivity constraints (Q2253960) ‎ (← 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)
• (Q5136326) ‎ (← links)
• An improved flow-based formulation and reduction principles for the minimum connectivity inference problem (Q5197998) ‎ (← links)
• Overlaying a hypergraph with a graph with bounded maximum degree (Q5918772) ‎ (← links)
• Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) ‎ (← links)