An analysis of the greedy algorithm for partially ordered sets

DOI10.1016/0166-218X(82)90069-5MaRDI QIDQ1161533zbMATH OpenFDO

Authors Cornelius Croitoru

Publication date 1982

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

zbMATH Keywords

greedy algorithmfree monoidgreedy solutionfinite partially ordered setindependence systemnatural weighting

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3544074 (Why is no real title available?)
• An Analysis of the Greedy Heuristic for Independence Systems
• Matroids and the greedy algorithm
• On approximate algorithms for combinatorial linear maximization problems
• The greedy algorithm for partially ordered sets
• Worst case analysis of greedy type algorithms for independence systems

This page was built for publication: An analysis of the greedy algorithm for partially ordered sets

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