Covering symmetric semi-monotone functions

We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-monotone function is NP-complete if all the values of the function are in {0, 1} and we provide a minimax theorem if all the

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Roland Grappe, Zoltán Szigeti
• Keywords: DAM 2008, NP-complete, Skew-supermodular Functions, Symmetric Semi-monotone Function