The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions

DOI10.1016/0166-218X(89)90018-8zbMath0673.94019OpenAlexW2063131468MaRDI QIDQ1121245

M. Reza Emamy-K.

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0166-218x(89)90018-8

zbMATH Keywords

greedy algorithmn-cubecompletely unimodal pseudo-Boolean functions

Mathematics Subject Classification ID

Cites Work

• Some results in combinatorial geometry
• From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
• Lengths of snakes in boxes
• Unnamed Item
• Unnamed Item

This page was built for publication: The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions