K-greedy algorithms for independence systems

DOI10.1007/BF01917662MaRDI QIDQ4173194zbMATH OpenOpenAlexFDO

Authors Dirk Hausmann, Bernhard Korte

Publication date 1978

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

Full work available at URL https://doi.org/10.1007/bf01917662

zbMATH Keywords

Combinatorial OptimizationComputational EfficiencyEnumerationGreedy AlgorithmIndependence Systems

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cites work

• An Analysis of the Greedy Heuristic for Independence Systems
• Lower bounds on the worst-case complexity of some oracle algorithms

Cited in

(6)

• Minimum partition of an independence system into independent sets
• Analytische Verfahren zur Dimensionierung von Fahrzeugsystemen
• A new greedy algorithm for the quadratic assignment problem
• On approximate algorithms for combinatorial linear maximization problems
• Constrained submodular maximization via a nonsymmetric technique
• Computing maximum matchings in temporal graphs

This page was built for publication: K-greedy algorithms for independence systems

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