A Note on Valid Inequalities for PageRank Optimization with Edge Selection Constraints

Shang-Ru Yang, Yung-Han Liao, Chih-Ching Chien +1

Csáji, Jungers, and Blondel prove that while a PageRank optimization problem with edge selection constraints is NP-hard, it can be solved optimally in polynomial time for the uncon…