1) The paper proposes improvements to the greedy algorithm for influence maximization in social networks. 2) It introduces new heuristics like degree discounting to speed up the algorithm with minimal loss in accuracy. 3) Experimental results show the improved greedy algorithm and heuristics achieve similar influence spread as the original greedy algorithm but with much shorter run times, in some cases orders of magnitude faster.