Abstract
A family of completely unimodal pseudo-Boolean functions is constructed inductively over the n-cube. The greedy algorithm performs an exponential number of steps when applied to this class of functions. This construction answers a question recently posed by Hammer, Simeone, Liebling and de Werra [4].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
