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


An analysis of the greedy algorithm for partially ordered sets
Authors:Cornelius Croitoru
Affiliation:Faculty of Mathematics, University of Iasi, Iasi R-6600, Romania
Abstract:The worst-case analysis of the greedy algorithm for a combinatorial problem of linear maximization on a partially ordered set (introduced by U. Faigle [3]) is given.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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