24 citations · 27 across the 3 of their papers we have counts for
3 papers
cs.DS2013★ 3 cited
An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree
Jochen Könemann, Sina Sadeghian, Laura Sanità
In the node-weighted prize-collecting Steiner tree problem (NW-PCST) we are given an undirected graph , non-negative costs and penalties for each .…
cs.GT2011★ 24 cited
On a Bounded Budget Network Creation Game
Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli +4
We consider a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In our model, each link has unit price and each agent trie…
cs.SI2011
On the Non-Progressive Spread of Influence through Social Networks
MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi +3
The spread of influence in social networks is studied in two main categories: the progressive model and the non-progressive model (see e.g. the seminal work of Kempe, Kleinberg, an…