Engineering
2 years ago

New algorithm revolutionizes solving Minimum Vertex Cover problem in neighborhoods!

1 view
arXiv (Cornell University)
Neighbourhood Evaluation Criteria for Vertex Cover Problem
Kaustubh K Joshi

Paper Summary

Neighbourhood Evaluation Criteria is an algorithm that helps find the smallest set of points in a network that covers all connections. It looks at the number of connections each point has, choosing the one with the most connections first. If there are ties, it picks the point with the least influence on its neighbors. If there are still ties, it selects the point that leaves the fewest other points uncovered.

Related papers

Theme background image
Computer Science
5 years ago

New algorithm revolutionizes solving Minimum Vertex Cover problem in neighborhoods!

Combinatorial Optimization
Graph Theory
Routing Problem
1 view
Theme background image
Computer Science
8 years ago

New algorithm revolutionizes solving minimum vertex cover problem for real-world applications.

Combinatorial Optimization
Robotics Coordination
Graph Theory
Theme background image
Engineering
8 years ago

New algorithm revolutionizes VLSI circuit design with 'close to optimum' solutions.

FPGA Design
Low-Power VLSI
VLSI Testing