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


An approximation algorithm for maximum triangle packing
Authors:Refael Hassin  Shlomi Rubinstein
Institution:Department of Statistics and Operations Research, Tel Aviv University, 69978 Tel Aviv, Israel
Abstract:We present a randomized View the MathML source-approximation algorithm for the weighted maximum triangle packing problem, for any given ε>0. This is the first algorithm for this problem whose performance guarantee is better than View the MathML source. The algorithm also improves the best-known approximation bound for the maximum 2-edge path packing problem.
Keywords:Analysis of algorithms  Maximum triangle packing  2-edge paths
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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