Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

DAM
2008

favoriteEmaildiscussreport

139views more DAM 2008»

Covering symmetric semi-monotone functions

13 years 11 months ago

Covering symmetric semi-monotone functions

Download www.g-scop.inpg.fr

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

Roland Grappe, Zoltán Szigeti

Real-time Traffic

DAM 2008 | NP-complete | Skew-supermodular Functions | Symmetric Semi-monotone Function |

claim paper

Related Content

» Lower bounds for designs in symmetric spaces

» Approximation Algorithms for MultiCriteria Traveling Salesman Problems

» Exact combinational logic synthesis and nonstandard circuit design

» On Approximating MultiCriteria TSP

» Bounded Size Graph Clustering with Applications to Stream Processing

» The Resurrecting Duckling What Next

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Roland Grappe, Zoltán Szigeti

Comments (0)