Given 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 is illustrated in the special case of finding a minimum spanning tree with q red edges; the time is O(m log log n + n α (n,n) log n). Efficient algorithms are also given for job scheduling matroids and partition matroids. An algorithm is given for finding a minimum spanning tree where a vertex r has prespecified degree; it shows this problem is equivalent to finding a minimum spanning tree, without the degree constraint. An algorithm is given for finding a minimum spanning tree on a directed graph, where the given root r has prespecified degree; the time is O(m log n), the same as for the problem without the degree constraint.
|Number of pages
|Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
|Published - 1979
|20th Annual Symposium on Foundations of Computer Science, FOCS 1979 - San Juan, United States
Duration: Oct 29 1979 → Oct 31 1979
All Science Journal Classification (ASJC) codes
- General Computer Science