Minimizing Average Shortest Path Distances via Shortcut Edge Addition
From MaRDI portal
Publication:3638883
DOI10.1007/978-3-642-03685-9_21zbMath1255.68307OpenAlexW1819194591MaRDI QIDQ3638883
Publication date: 28 October 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_21
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (17)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Strengthening ties towards a highly-connected world ⋮ Impact of the topology of urban streets on mobility optimization ⋮ Improving the Betweenness Centrality of a Node by Adding Links ⋮ Network structure optimization for social networks by minimizing the average path length ⋮ Demand-aware network designs of bounded degree ⋮ On the fixed-parameter tractability of the maximum connectivity improvement problem ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Local search algorithms for the red-blue median problem ⋮ Location of speed-up subnetworks ⋮ Optimization of the critical diameter and average path length of social networks ⋮ Using shortcut edges to maximize the number of triangles in graphs ⋮ On the maximum betweenness improvement problem ⋮ Improved approximation for prize-collecting red-blue median ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition ⋮ Some results about the inset edge and average distance of trees
This page was built for publication: Minimizing Average Shortest Path Distances via Shortcut Edge Addition
