Primal-dual schema based approximation algorithms

被引:0
|
作者
Vazirani, VV [1 ]
机构
[1] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The primal-dual schema, a general algorithm design method, has yielded approximation algorithms for a diverse collection of NP-hard problems. Perhaps its most remarkable feature is that despite its generality, it has yielded algorithms with good approximation guarantees as well as good running times. This survey provides some insights into how this comes about as well as a discussion on future work.
引用
收藏
页码:198 / 207
页数:10
相关论文
共 50 条