On the maximum betweenness improvement problem
DOI10.1016/J.ENTCS.2016.03.011zbMATH Open1344.68174OpenAlexW2338639814WikidataQ113317693 ScholiaQ113317693MaRDI QIDQ737099FDOQ737099
Authors: Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj 
Publication date: 5 August 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2016.03.011
Recommendations
- On the maximum connectivity improvement problem
- A mixed integer linear programming formulation of the maximum betweenness problem
- An improved approximation algorithm for the maximum TSP
- Algorithms – ESA 2005
- On the fixed-parameter tractability of the maximum connectivity improvement problem
- Improved deterministic approximation algorithms for max TSP
- Improved approximation algorithms for metric MaxTSP
- An improved randomized approximation algorithm for Max TSP
- The Maximum Disjoint Routing Problem
- Better approximations for max TSP
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cites Work
- A threshold of ln n for approximating set cover
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- The design of approximation algorithms
- A critical point for random graphs with a given degree sequence
- A faster algorithm for betweenness centrality*
- The Effect of New Links on Google Pagerank
- The asymptotic number of labeled graphs with given degree sequences
- On the approximability of the link building problem
- Better Approximation of Betweenness Centrality
- Minimizing the diameter of a network using shortcut edges
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition
- Axioms for Centrality
- Approximating Betweenness Centrality in Large Evolving Networks
- Title not available (Why is that?)
Cited In (6)
- Maximum betweenness centrality: approximability and tractable cases
- Hardness of bounding influence via graph modification
- Optimizing node infiltrations in complex networks by a local search based heuristic
- Generalized budgeted submodular set function maximization
- Title not available (Why is that?)
- Improving the Betweenness Centrality of a Node by Adding Links
Uses Software
This page was built for publication: On the maximum betweenness improvement problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q737099)
