K-greedy algorithms for independence systems

DOI10.1007/BF01917662zbMath0391.90068OpenAlexW2069448900MaRDI QIDQ4173194

Bernhard Korte, Dirk Hausmann

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

EnumerationCombinatorial OptimizationGreedy AlgorithmComputational EfficiencyIndependence Systems

Mathematics Subject Classification ID

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

Related Items (6)

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

Cites Work

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

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