An analysis of the greedy algorithm for partially ordered sets

DOI10.1016/0166-218X(82)90069-5zbMath0479.06002MaRDI QIDQ1161533

Cornelius Croitoru

Publication date: 1982

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

zbMATH Keywords

greedy algorithmindependence systemfree monoidgreedy solutionfinite partially ordered setnatural weighting

Mathematics Subject Classification ID

Partial orders, general (06A06) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Cites Work

• Unnamed Item
• The greedy algorithm for partially ordered sets
• Worst case analysis of greedy type algorithms for independence systems
• On approximate algorithms for combinatorial linear maximization problems
• An Analysis of the Greedy Heuristic for Independence Systems
• Matroids and the greedy algorithm