Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Matching Under Preferences
Speaker:Deeksha Adil
coming from:Indian Institute of Science Education and Research - India
Speakers Bio:graduated Master student
Event Type:PhD Application Talk
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:Public Audience
Language:English
Date, Time and Location
Date:Monday, 19 June 2017
Time:10:00
Duration:90 Minutes
Location:Saarbr├╝cken
Building:E1 4
Room:0.24
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
Name(s):Caroline Brill
Phone:+49 681 - 93 25 1800
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):
Created:
Caroline Brill/MPI-INF, 06/14/2017 01:44 PM
Last modified:
halma/MPII/DE, 01/17/2019 02:55 AM
  • Caroline Brill, 06/14/2017 01:48 PM -- Created document.