Question: User please help me solve this problem: A set of n broadway shows are playing in London. A group of m tourists visit the city.
User please help me solve this problem: A set of n broadway shows are playing in London. A group of m tourists visit the city. Each tourist is asked to list their two favorite shows. The goal is to select a set of S shows in such a way that we minimize the number of tourists who have exactly one of their favorite shows on list S. Model this problem as a graph, where each show is a vertex. Your job is to find the name for this graph problem, and determine if there is a known polynomial-time algorithm to solve it
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
