首页 | 本学科首页   官方微博 | 高级检索  
     


On different approximation criteria for subset product problems
Authors:A. Marchetti-Spaccamela  G. Romano
Affiliation:Dipartimento d''Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Eudossiana 18, 00184 Roma, Italy
Abstract:We study and compare three different approximation criteria for a class of problems with product objective function. We also show that a dominance rule is a necessary and sufficient condition for the approximability of the same class of problems.
Keywords:Analysis of algorithms  combinatorial problem  approximation properties
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号