On the maximum betweenness improvement problem
type: Item
instance of: scholarly article
title: On the maximum betweenness improvement problem
zbMATH Open document ID: 1344.68174
author: Gianlorenzo D'Angelo
author: Lorenzo Severini
author: Yllka Velaj
publication date: 2016-08-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6609753
zbMATH Keywords: betweenness centrality
zbMATH Keywords: approximation algorithms
zbMATH Keywords: graph augmentation
describes a project that uses: KONECT
MaRDI profile type: Publication
full work available at URL: j.entcs.2016.03.011
OpenAlex ID: W2338639814
Wikidata QID: Q113317693
cites work: The Effect of New Links on Google Pagerank
cites work: Emergence of Scaling in Random Networks
cites work: The asymptotic number of labeled graphs with given degree sequences
cites work: Approximating Betweenness Centrality in Large Evolving Networks
cites work: Axioms for Centrality
cites work: A faster algorithm for betweenness centrality*
cites work: Minimizing the Diameter of a Network Using Shortcut Edges
cites work: Q3267900
cites work: A threshold of ln n for approximating set cover
cites work: Better Approximation of Betweenness Centrality
cites work: Minimizing Average Shortest Path Distances via Shortcut Edge Addition
cites work: A critical point for random graphs with a given degree sequence
cites work: On the approximability of the link building problem
cites work: Q5852580
cites work: The Design of Approximation Algorithms
DOI: 10.1016/J.ENTCS.2016.03.011
Recommended article: On the maximum connectivity improvement problem
Recommended article: A mixed integer linear programming formulation of the maximum betweenness problem
Recommended article: An improved approximation algorithm for the maximum TSP
Recommended article: Algorithms – ESA 2005
Recommended article: On the fixed-parameter tractability of the maximum connectivity improvement problem
Recommended article: Improved deterministic approximation algorithms for max TSP
Recommended article: Improved approximation algorithms for metric MaxTSP
Recommended article: An improved randomized approximation algorithm for Max TSP
Recommended article: The Maximum Disjoint Routing Problem
Recommended article: Better approximations for max TSP
description: scientific article; zbMATH DE number 6609753