Re:The World's Simplest Interesting Algorithm (2019)
by saagarjha on Wednesday June 10, 2020 @01:40AM
(#23474305)
Your set would contain all the vertices, while you can do better by only including some. For example, think of three vertices in a line with the first and second vertex joined by and edge and the second and third. The “optimal cover” picks the second vertex and covers both edges.
[ Parent
| on HN ]
There are no comments on this comment yet.