顶点覆盖问题的邻域评价准则
Neighbourhood Evaluation Criteria for Vertex Cover Problem
摘要：
邻域评价准则是一种尝试求解最小顶点覆盖的非线性近似算法。度计数保持在检查每个顶点和最高计数的顶点包括在我们的覆盖集。在多个等效顶点的情况下，选择具有最低邻域影响的顶点。如果仍然存在多个等效顶点，则选择剩余活动顶点数最少（独立集启用计数最高）的顶点作为决胜点。
英文摘要：
Neighbourhood Evaluation Criteria is a heuristical approximate algorithm that attempts to solve the Minimum Vertex Cover. degree count is kept in check for each vertex and the highest count based vertex is included in our cover set. In the case of multiple equivalent vertices, the one with the lowest neighbourhood influence is selected. In the case of still existing multiple equivalent vertices, the one with the lowest remaining active vertex count (the highest Independent Set enabling count) is selected as a tie-breaker.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
