The 2-quasi-greedy algorithm for cardinality constrained matroid bases

DOI10.1016/0166-218X(86)90088-0zbMath0596.90094MaRDI QIDQ1079134

Beth Novick, Fred Glover

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimum weight basequasi-greedy algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem

Cites Work

• Efficient algorithms for a family of matroid intersection problems
• Fast Approximation Algorithms for Knapsack Problems
• Worst-Case Analysis of Heuristic Algorithms
• A good algorithm for smallest spanning trees with a degree constraint
• An Analysis of the Greedy Heuristic for Independence Systems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Matroids and the greedy algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The 2-quasi-greedy algorithm for cardinality constrained matroid bases