Sufficient conditions for the optimality of the greedy algorithm in greedoids

DOI10.1007/s10878-021-00833-yzbMath1498.90204OpenAlexW3215902434MaRDI QIDQ2168727

Dávid Szeszlér

Publication date: 26 August 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00833-y

zbMATH Keywords

greedy algorithmmatroidgreedoid

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Simultaneous eating algorithm and greedy algorithm in assignment problems

Cites Work

• Unnamed Item
• Unnamed Item
• Greedoids
• New polyhedral and algorithmic results on greedoids
• Greedoids and Linear Objective Functions
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Matroids and the greedy algorithm

This page was built for publication: Sufficient conditions for the optimality of the greedy algorithm in greedoids