Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition

Authors:
Sachin Patkar;H. Narayanan
Affiliations:
-;-
Venue:
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2000

Citing 8
Cited 1

Optimal attack and reinforcement of a network

Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Computing the strength of a graph

SIAM Journal on Computing
A faster algorithm for computing the strength of a network

Information Processing Letters
Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach

Journal of Algorithms
Algorithms for graphic polymatroids and parametric &smacr;-sets

Journal of Algorithms
Principal Lattice of Partition of submodular functions on Graphs: Fast algorithms for Principal Partition and Generic Rigidity

ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
The Multi-Tree Approach To Reliability In Distributed Networks

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Wiretapping a Hidden Network

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of computing the strength and performing optimal reinforcement for an edge-weighted graph G(V, E, w) is well-studied [1,2,3,6,7,9]. In this paper, we present fast (sequential linear time and parallel logarithmic time) on-line algorithms for optimally reinforcing the graph when the reinforcement material is available continuosly online. These are first on-line algortithms for this problem. Although we invest some time in preprocessing the graph before the start of our algorithms, it is also shown that the output of our on-line algorithms is as good as that of the off-line algorithms, making our algorithms viable alternatives to the fastest off-line algorithms in situtations when a sequence of more than O(|V|) reinforcement problems need to be solved. In such a situation the time taken for preprocessing the graph is less that the time taken for all the invocations of the fastest off-line algorithms. Thus our algorithms are also efficient in the general sense. The key idea is to make use of the theory of Principal Partition of a Graph. Our results can be easily generalized to the general setting of principal partition of nondecreasing submodular functions.