Finding groups with maximum betweenness centrality via integer programming with random path sampling (Q6183091)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding groups with maximum betweenness centrality via integer programming with random path sampling |
scientific article; zbMATH DE number 7795433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
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
0 references
0.8800050020217896
0 references
0.7616679072380066
0 references
0.7581710815429688
0 references
0.7429004907608032
0 references
