Simple linear time approximation algorithm for betweenness
From MaRDI portal
Publication:1939683
DOI10.1016/j.orl.2012.08.008zbMath1258.90098WikidataQ56486200 ScholiaQ56486200MaRDI QIDQ1939683
Publication date: 5 March 2013
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.08.008
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A Faster Algorithm to Update Betweenness Centrality After Node Alteration, Unnamed Item, Characterization and representation problems for intersection betweennesses, Betweenness parameterized above tight lower bound, On subbetweennesses of trees: hardness, algorithms, and characterizations, A Faster Algorithm to Update Betweenness Centrality after Node Alteration, Maximizing Polynomials Subject to Assignment Constraints
Cites Work