Data structures for on-line updating of matroid intersection solutions

Authors:
Greg N. Frederickson;Mandayam A. Srinivas
Affiliations:
-;-
Venue:
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Year:
1984

Citing 3
Cited 0

Adding range restriction capability to dynamic data structures

Journal of the ACM (JACM)
A data structure for dynamic trees

Journal of Computer and System Sciences
Data structures for on-line updating of minimum spanning trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

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.