MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Matching Under Preferences

Deeksha Adil
Indian Institute of Science Education and Research - India
PhD Application Talk

graduated Master student
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI  
Public Audience
English

Date, Time and Location

Monday, 19 June 2017
10:00
90 Minutes
E1 4
0.24
Saarbrücken

Abstract

We look at two different NP-Hard variants of the classical stable marriage problem in the realm of Parameterized Complexity. The first, Stable Marriage with ties and incomplete lists, we give parameterized algorithms with solution size as the parameter. The second, Hospital Residents Problem with lower quotas, we give an XP-algorithm and show some W[1] hardness results.

Contact

Caroline Brill
+49 681 - 93 25 1800
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Caroline Brill, 06/14/2017 13:48 -- Created document.