Data structures for on-line updating of matroid intersection solutions
Abstract
References
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
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 258Total Downloads
- Downloads (Last 12 months)25
- Downloads (Last 6 weeks)4
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