CompTIA
DY0-001 · Question #34
Which of the following is best solved with graph theory?
The correct answer is B. Traveling salesman. The traveling-salesman problem is a prototypical graph theory challenge, finding the shortest tour through a graph's nodes, whereas the other tasks rely on different domains (OCR on image processing, fraud detection often on statistical/anomaly methods, bandit problems on…
Mathematics and Statistics
Question
Which of the following is best solved with graph theory?
Options
- AOptical character recognition
- BTraveling salesman
- CFraud detection
- DOne-armed bandit
How the community answered
(25 responses)- A8% (2)
- B88% (22)
- C4% (1)
Explanation
The traveling-salesman problem is a prototypical graph theory challenge, finding the shortest tour through a graph's nodes, whereas the other tasks rely on different domains (OCR on image processing, fraud detection often on statistical/anomaly methods, bandit problems on sequential decision theory).
Topics
#graph theory#traveling salesman problem#network analysis#combinatorial optimization
Community Discussion
No community discussion yet for this question.