An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed. 摘要給出了求解一類(lèi)上模集函數最小值問(wèn)題的一種近似算法，并討論了所給算法的性能保證。
Then, a linear time approximation algorithm was developed, which also provided a solution with the same worst case approximation bounds as LP-approximation. 然后設計了一個(gè)非常簡(jiǎn)單有用的可以和廿近似算法得到一樣好的近似解的線(xiàn)性時(shí)間近似算法。
