Staying safe and visible via message sharing in online social networks

DOI10.1007/s10878-013-9667-zzbMath1304.90178OpenAlexW2095289550MaRDI QIDQ405681

H. T. Nguyen, Yilin Shen, Thang N. Dinh, My T. Thai

Publication date: 5 September 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9667-z

zbMATH Keywords

computational complexityapproximation algorithmsonline social networkscircle of trust

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear time algorithms for some separable quadratic programming problems
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Clique is hard to approximate within \(n^{1-\epsilon}\)