Finding groups with maximum betweenness centrality via integer programming with random path sampling (Q6183091): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Centrality Maximization for Large-scale Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster computation of successive bounds on the group betweenness centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental deployment of network monitors based on Group Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centrality of groups and classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Betweenness Centrality: Approximability and Tractable Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3063920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sample Average Approximation Method for Stochastic Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2833177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation of betweenness centrality through sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2925334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding groups with maximum betweenness centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Latest revision as of 21:04, 23 August 2024

scientific article; zbMATH DE number 7795433
Language Label Description Also known as
English
Finding groups with maximum betweenness centrality via integer programming with random path sampling
scientific article; zbMATH DE number 7795433

    Statements

    Finding groups with maximum betweenness centrality via integer programming with random path sampling (English)
    0 references
    0 references
    0 references
    0 references
    26 January 2024
    0 references
    network analysis
    0 references
    group betweenness centrality
    0 references
    randomized algorithms
    0 references
    sample average approximation (SAA)
    0 references
    linear mixed-integer programming
    0 references

    Identifiers