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


A list heuristic for vertex cover
Authors:David Avis  Tomokazu Imamura
Affiliation:a School of Computer Science, McGill University, 3480 University, Montreal, Que., Canada H3A 2A7
b Graduate School of Informatics, Kyoto University, Japan
Abstract:
We analyze a list heuristic for the vertex cover problem that handles the vertices in a given static order based on the degree sequence. We prove an approximation ratio of at most View the MathML source for a nonincreasing degree sequence, and show that no ordering can achieve an approximation ratio of less than View the MathML source.
Keywords:Vertex cover   Approximation algorithm   List heuristic
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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