Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity

11/29/2019
by   Alane M. de Lima, et al.
0

In this paper we are interested in the all-pairs shortest paths problem (APSP) for an input graph G assumed to be connected undirected with non negative real edge weights. In the exact deterministic case, it is an open question whether this problem admits a O(n^3-c) time algorithm, for any constant c>0, even in the case where edge weights are natural numbers. There is a variety of approximation algorithms for the problem and the time complexity of the fastest one depends on the graph being sparse or dense and also on the corresponding approximation guarantee. In this paper we deal with a version of the APSP that fits neither in the exact nor the approximate case. We give a O(n^2 log n) randomized algorithm for APSP such that for every pair of vertices the algorithm either computes the exact shortest path or does not compute any shortest path, depending on a certain measure of “importance” (or centrality) of the shortest path in question.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2021

Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time

We study the decremental All-Pairs Shortest Paths (APSP) problem in undi...
research
03/20/2021

Preprocessing power weighted shortest path data using a s-Well Separated Pair Decomposition

For s > 0, we consider an algorithm that computes all s-well separated p...
research
05/16/2018

Wireless coverage prediction via parametric shortest paths

When deciding where to place access points in a wireless network, it is ...
research
09/29/2021

(Machine) Learning to Improve the Empirical Performance of Discrete Algorithms

This paper discusses a data-driven, empirically-based framework to make ...
research
02/05/2019

Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach

This paper focuses on network resilience to perturbation of edge weight....
research
12/11/2017

The Minimum Edge Compact Spanner Network Design Problem

In this paper we introduce and study the Minimum Edge Compact Spanner (M...
research
11/19/2021

An Improved Analysis of Greedy for Online Steiner Forest

This paper considers the classic Online Steiner Forest problem where one...

Please sign up or login with your details

Forgot password? Click here to reset