拟阵约束下非负非减下模函数最大值问题的近似算法及其性能保证
의진약속하비부비감하모함수최대치문제적근사산법급기성능보증
The Greedy Algorithm and Its Performance Guarantees for Maximizing Nonne-ativeand Non-decreasing Submodular Function Subject to a Partition Matroid Constraint
  • 万方数据
    德州学院学报 덕주학원학보
    JOURNAL OF DEZHOU UNIVERSITY
    2012年 4期 9-10 ,共2页

    梁国宏%刘光荣%王武民

    량국굉%류광영%왕무민

    组合优化问题%下模函数%近似算法%性能. 組閤優化問題%下模函數%近似算法%性能.
    조합우화문제%하모함수%근사산법%성능.
    combinatorial optimization problem%submodular function%approximation algo-rithm%performance guarantee
    下模函数的最值问题在组合优化问题中有着广泛的应用,给出了具有剥分拟阵约束下非负非减下模函数最大值问题的近似算法,并讨论了所给算法的性能保证.
    하모함수적최치문제재조합우화문제중유착엄범적응용,급출료구유박분의진약속하비부비감하모함수최대치문제적근사산법,병토론료소급산법적성능보증.
    Maximizing or minimizing submodular function has widely used in combinatorial optimization problem,in this paper,we present an approximation algorithm for the greedy algorithm of maximizing non-negative and non-decreasing submodular function subject to a partition matroid constraint,and discuss its performance guarantee.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문