Discussion
The greedy (approximation) vertex cover problem is a
Answer: A
It is a 2-approximation problem.
The standard approximation algorithm picks any remaining edge (u, v), puts both u and v in the cover, deletes every edge touching them, and repeats. The edges it picks share no vertices, and any vertex cover must contain at least one end of each of them, so the cover it builds is at most twice the size of the optimum.
The ratio 2 is tight, so the algorithm is classed as a 2-approximation. A bound of 3 is weaker and not how it is described, which rules out the 3-approximation and 'Both' options.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development