Inferring Social Networks from Outbreaks

DOI10.1007/978-3-642-16108-7_12zbMath1306.68125OpenAlexW1787635289MaRDI QIDQ4930692

James Aspnes, Lev Reyzin, Dana Angluin

Publication date: 1 October 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.1503

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (8)

On the approximability and hardness of minimum topic connected overlay and its special instances ⋮ A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem ⋮ Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem ⋮ Network construction with subgraph connectivity constraints ⋮ Overlaying a hypergraph with a graph with bounded maximum degree ⋮ An improved flow-based formulation and reduction principles for the minimum connectivity inference problem ⋮ Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles ⋮ Unnamed Item

This page was built for publication: Inferring Social Networks from Outbreaks