241 citations · 429 across the 7 of their papers we have counts for
4 papers · 1 filter
A Robust and Scalable Algorithm for the Steiner Problem in Graphs
Thomas Pajor, Eduardo Uchoa, Renato F. Werneck
We present an effective heuristic for the Steiner Problem in Graphs. Its main elements are a multistart algorithm coupled with aggressive combination of elite solutions, both lever…
Distance-Based Influence in Networks: Computation and Maximization
Edith Cohen, Daniel Delling, Thomas Pajor +1
A premise at a heart of network analysis is that entities in a network derive utilities from their connections. The {\em influence} of a seed set of nodes is defined as the sum…
Computing Classic Closeness Centrality, at Scale
Edith Cohen, Daniel Delling, Thomas Pajor +1
Closeness centrality, first considered by Bavelas (1948), is an importance measure of a node in a network which is based on the distances from the node to all other nodes. The clas…
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees
Edith Cohen, Daniel Delling, Thomas Pajor +1
Propagation of contagion through networks is a fundamental process. It is used to model the spread of information, influence, or a viral infection. Diffusion patterns can be specif…