On approximate algorithms for combinatorial linear maximization problems

DOI10.1007/BF01919244zbMath0462.68017MaRDI QIDQ3912014

No author found.

Publication date: 1980

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial programmingguaranteed performanceapproximative algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Related Items

An analysis of the greedy algorithm for partially ordered sets

Cites Work

• K-greedy algorithms for independence systems
• An Analysis of the Greedy Heuristic for Independence Systems
• Matroids and the greedy algorithm
• Unnamed Item