DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Proceedings papers >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/100/1898

Title: Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
Authors: PATKAR, SB
NARAYANAN, H
Keywords: lattice
polymatroids
strength
Issue Date: 2000
Publisher: SPRINGER-VERLAG BERLIN
Citation: FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS,1974,94-105
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.
URI: http://dspace.library.iitb.ac.in/xmlui/handle/10054/15142
http://hdl.handle.net/100/1898
ISBN: 3-540-41413-4
ISSN: 0302-9743
Appears in Collections:Proceedings papers

Files in This Item:

There are no files associated with this item.

View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback