Data structures for on-line updating of matroid intersection solutions
Pages 383 - 390
Abstract
Matroid intersection problems are considered in which one of the matroids is a partition matroid specifying that exactly q elements in the solution must be red, and the rest green. A characterization is presented for how the solution changes when one element changes in cost. Data structures are given for maintaining the solutions to several such problems online under the operation of changing an edge cost. Efficient update algorithms are given for maintaining a red-green minimum spanning tree in both a general and a planar graph, and a red-green job schedule for unit-time jobs with integer release times and deadlines.
References
[1]
O. Boruvka, O jistem problemu minimalnim, Praca Moravske Prirodovedecke Spolecnosti 3 (1926) 37-58.
[2]
D. Cheriton and R. Tarjan, Finding minimum spanning trees, SIAM J. Comput. 5 (1976) 724-742.
[3]
G. N. Frederickson, Data structures for on-line updating of minimum spanning trees, Proc. 15th ACM Symp. on Theory of Computing, Boston (April 1983) 252-257.
[4]
G. N. Frederickson and M. A. Srinivas, On-line updating of degree-constrained minimum spanning trees, Extended abstract (1983).
[5]
H. N. Gabow and R. E. Tarjan, Efficient algorithms for a family of matroid intersection problems, to appear in J. Algorithms.
[6]
D. Gusfield, Matroid optimization with the interleaving of two ordered sets, to appear in Disc. Appl. Math.
[7]
E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York (1976).
[8]
M.H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Comp. Sys. Sci. 23, 2 (October 1981) 166-204.
[9]
D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J. Comp. Sys. Sci. 26 (1983) 362-391.
[10]
D. J. A. Welsh, Matroid Theory, Academic Press, New York (1976).
[11]
D. E. Willard and G. Lueker, A transformation for adding range restriction capability to data structures, to appear in J ACM.
[12]
A.C. Yao, An O(EloglogV) algorithm for finding minimum spanning trees, |Inf. Proc. Lett. 4# (1975) 21-23.
Index Terms
- Data structures for on-line updating of matroid intersection solutions
Recommendations
Exact and approximation algorithms for weighted matroid intersection
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithmsIn this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our approximation algorithm delivers a (1 ...
Efficient algorithms for simple matroid intersection problems
SFCS '79: Proceedings of the 20th Annual Symposium on Foundations of Computer ScienceGiven a matroid, where each element has a realvalued cost and is colored red or green; we seek a minimum cost base with exactly q red elements. This is a simple case of the matroid intersection problem. A general algorithm is presented. Its efficiency ...
Comments
Information & Contributors
Information
Published In
Copyright © 1984 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 December 1984
Check for updates
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 258Total Downloads
- Downloads (Last 12 months)25
- Downloads (Last 6 weeks)4
Reflects downloads up to 02 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in