Computer Science · Design and Analysis of Algorithms
Consider the following statements regarding approximation algorithms: Statement I: The Vertex-Cover problem has a polynomial-time 2-approximation algorithm. Statement II: The Traveling Salesperson Problem (TSP) with triangle inequality has a polynomial-time 3-approximation algorithm. Which of the following is correct?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement I is true and Statement II is false✓
- 2Both Statement I and Statement II are true
- 3Statement I is false and Statement II is true
- 4Both Statement I and Statement II are false
Correct answer
Statement I is true and Statement II is false
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Design and Analysis of Algorithms MCQs →Want more practice questions on Design and Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Design and Analysis of Algorithms