Optimizing node discovery on networks: problem definitions, fast algorithms, and observations

DOI10.1016/j.ins.2018.10.036zbMath1443.90328arXiv1703.04307OpenAlexW2753387861MaRDI QIDQ2201666

Junzhou Zhao, John C. S. Lui, Pinghui Wang

Publication date: 29 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.04307

zbMATH Keywords

greedy algorithmrandom walkMCMC simulationsubmodular/supermodular set function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing PageRank via outlinks
• A note on maximizing a submodular set function subject to a knapsack constraint
• The budgeted maximum coverage problem
• A note on maximizing the spread of influence in social networks
• I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
• Probability and Statistics with Reliability, Queuing and Computer Science Applications
• An analysis of approximations for maximizing submodular set functions—I
• Axioms for Centrality
• Probability Inequalities for Sums of Bounded Random Variables
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• The Effect of New Links on Google Pagerank

This page was built for publication: Optimizing node discovery on networks: problem definitions, fast algorithms, and observations