Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Consider a bipartite graph G = (U, V, E) on 2n vertices that contains a perfect matching. Suppose the vertices in U arrive in an

Consider a bipartite graph G = (U, V, E) on 2n vertices that contains a perfect matching. Suppose the vertices in U arrive in an online fashion and the edges incident to each vertex u ? U are revealed when u arrives. When this happens, the algorithm may match u to a previously unmatched adjacent vertex in V , if there is one. Such a decision, once made is irrevocable. The objective is to maximize the size of the resulting matching.

Consider the algorithm that always matches a vertex in U if a match is possible. Show that this algorithm achieves a competitive ratio of 1/2.

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: 3

blur-text-image

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

Database Management Systems Designing And Building Business Applications

Authors: Gerald V. Post

1st Edition

0072898933, 978-0072898934

More Books

Students also viewed these Databases questions

Question

What are Decision Trees?

Answered: 1 week ago

Question

What is meant by the Term Glass Ceiling?

Answered: 1 week ago