Abstract
This paper proposes a time-efficient distributed solution for the matroid basis completion problem. The solution is based on a technique called climination upcast, enabling us to reduce the amount of work necessary for the upcast by relying on the special properties of matroids. As an application, it is shown that the algorithm can be used for correcting a minimum weight spanning tree computed for a D-diameter network, after k edges have changed their weight, in time O(k+D).
Supported in part by grants from the Israel Science Foundation and from the Israel Ministry of Science and Art.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baruch Awerbuch, Israel Cidon, and Shay Kutten. Communication-optimal maintenance of dynamic trees. Unpublished manuscript, September 1988.
Israel Cidon, Shay Kutten, Yishay Mansour, and David Peleg. Greedy packet scheduling. In Proc. 4th Workshop on Distributed Algorithms, pages 169–184, 1990. LNCS Vol. 486, Springer Verlag.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
Robert G. Gallager, Pierre A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Programming Lang. and Syst., 5(1):66–77, January 1983.
J. Garay, S. Kutten, and D. Peleg. A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM J. on Computing, 1998. To appear. Extended abstract appeared in 34th IEEE Symp. on Foundations of Computer Science, pages 659–668, November 1993.
B. Korte and L. Lovász. Mathematical structures undelying greedy algorithms. in: Fundamentals of Computation Theory, Lecture Notes in Computer Science, 117:205–209, 1981.
B. Korte and L. Lovász. Structural properties of greedoids. Combinatorica, 3:359–374, 1983.
B. Korte and L. Lovász. Greedoids-a structural framework for the greedy algorithms. in: W. Pulleybank editor, Progress in Combinatorial Optimization, pages 221–243, 1984.
B. Korte and L. Lovász. Greedoids and linear objective functions. SIAM J. Alg. and Disc. Meth., 5:229–238, 1984.
Shay Kutten and David Peleg. Fast distributed construction of k-dominating sets and applications. In Proc. 14th ACM Symp. on Principles of Distributed Computing, 1995.
Shay Kutten and David Peleg. Fault-local distributed mending. In Proc. 14th ACM Symp. on Principles of Distributed Computing, August 1995.
Shay Kutten and David Peleg. Tight fault-locality. In Proc 36th IEEE Symp. on Foundations of Computer Science, October 1995.
E.L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1970.
Y. Mansour and B. Patt-Shamir. Greedy packet scheduling on shortest paths. In Proc. 10th ACM Symp. on Principles of Distributed Computing, August. 1991.
C.H. Papadimitriou and K. Sleiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., 1982.
P. I. Rivera-Vega, K. Varadarajan, and S. B. Navathe. The file redistribution scheduling problem. In Data Eng. Conf., pages 166–173, 1990.
Robert E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D. (1998). Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055050
Download citation
DOI: https://doi.org/10.1007/BFb0055050
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive