tag:blogger.com,1999:blog-8890204.post5405947393081680134..comments2024-03-10T05:26:42.148-04:00Comments on My Biased Coin: Technology Diffusion (Guest Post from Zhenming Liu)Michael Mitzenmacherhttp://www.blogger.com/profile/06738274256402616703noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-8890204.post-26794888015955799822012-02-27T23:47:54.479-05:002012-02-27T23:47:54.479-05:00Anon #2: No, it's not.Anon #2: No, it's not.Michael Mitzenmacherhttps://www.blogger.com/profile/02161161032642563814noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-43530550201362628812012-02-27T07:19:54.637-05:002012-02-27T07:19:54.637-05:00Isn't this exactly set cover where instead of ...Isn't this exactly set cover where instead of "immediate neighbors" you use the set of all reachable nodes?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-52143377397332535342012-02-27T01:01:34.457-05:002012-02-27T01:01:34.457-05:00The fastest influence max I was aware of was from ...The fastest influence max I was aware of was from Chi Wang at UIUC<br /><br />https://netfiles.uiuc.edu/chiwang1/shared/kdd10_influence.pdf<br /><br />They basically said the greedy approach wasn't working very well and come up with some heuristics, but I don't think they proved any guarantees on how well it approximated.<br /><br />Well done on this work!Rick Barberhttps://www.blogger.com/profile/13254231378907702361noreply@blogger.com