6. You have taken a new job with a small marketing platform. Their main line of business is to send marketing messages to people on their extensive email list. The messages are not cheap; companies wanting to send messages must purchase them individually while specifying certain groups of people to receive them. Of course, nobody likes spam, so you try to make sure each person receives at most one marketing email a day. Suppose at the start of the day you are given a list of m messages, a list of n email addresses, and a table specifying which messages can be sent to which email addresses. Describe and analyze an algorithm that computes the maximum number of marketing emails you can send so each individual message is sent at most once and each email address receives at most one message. Advice: Reduce the problem to bipartite matching or maximum flow.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
6. You have taken a new job with a small marketing platform. Their main line of business
is to send marketing messages to people on their extensive email list. The messages are
not cheap; companies wanting to send messages must purchase them individually while
specifying certain groups of people to receive them. Of course, nobody likes spam, so you
try to make sure each person receives at most one marketing email a day.
Suppose at the start of the day you are given a list of m messages, a list of n email
addresses, and a table specifying which messages can be sent to which email addresses.
Describe and analyze an algorithm that computes the maximum number of marketing
emails you can send so each individual message is sent at most once and each email
address receives at most one message.
Advice: Reduce the problem to bipartite matching or maximum flow.
Transcribed Image Text:6. You have taken a new job with a small marketing platform. Their main line of business is to send marketing messages to people on their extensive email list. The messages are not cheap; companies wanting to send messages must purchase them individually while specifying certain groups of people to receive them. Of course, nobody likes spam, so you try to make sure each person receives at most one marketing email a day. Suppose at the start of the day you are given a list of m messages, a list of n email addresses, and a table specifying which messages can be sent to which email addresses. Describe and analyze an algorithm that computes the maximum number of marketing emails you can send so each individual message is sent at most once and each email address receives at most one message. Advice: Reduce the problem to bipartite matching or maximum flow.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Topological Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education