Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems

DOI10.1137/0218008MaRDI QIDQ3823151zbMATH OpenOpenAlexFDO

Authors Greg N. Frederickson, Mandayam A. Srinivas

Publication date 1989

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cstech/601

zbMATH Keywords

spanning treesmatroidefficient algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Algorithms in computer science (68W99)

Recommendations

• Efficient algorithms for a family of matroid intersection problems
• On-line updating of solutions to a class of matroid intersection problems
• A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
• A multiply constrained matroid optimization problem
• Matroid optimization with generalized constraints

Cited in

(16)

• Least and most colored bases
• On-line updating of solutions to a class of matroid intersection problems
• scientific article; zbMATH DE number 26304 (Why is no real title available?)
• Efficient algorithms for a family of matroid intersection problems
• How to allocate review tasks for robust ranking
• Optimization problems with color-induced budget constraints
• Matroid optimization with generalized constraints
• scientific article; zbMATH DE number 3904590 (Why is no real title available?)
• scientific article; zbMATH DE number 4068895 (Why is no real title available?)
• Optimization problems with color-induced budget constraints
• A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
• Intersection Algorithms and CAGD
• Fast algorithms via dynamic-oracle matroids
• A bound for the symmetric travelling salesman problem through matroid formulation
• Maintaining minimum spanning trees in dynamic graphs
• The k-path tree matroid and its applications to survivable network design

This page was built for publication: Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823151)