Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Suppose you want to attend as many distinct shows as possible. The list of the shows on that day is released every evening. You do

Suppose you want to attend as many distinct shows as possible. The list of the shows on that day is released every evening. You do not know what shows will be on sale in the future. Your goal is to design an online algorithm that chooses what shows to attend every day. The algorithm should maximize the number of shows you attend. Please, keep in mind that you do not want to attend the same show twice.

Formally, on day t, your algorithm receives set St with the list of shows available on that day. The algorithm may choose a show from the list St and buy a ticket to this show. The goal of the algorithm is to maximize the number of distinct shows you attend.

Design a 2-competitive deterministic online algorithm and analyze its performance.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_step_2

Step: 3

blur-text-image_step3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

More Books

Students also viewed these Accounting questions