Seminars

View all Seminars  |  Download ICal for this event

Multi-criteria lossy kernel for Fair and Matroid constrained Satisfiability

Series: Bangalore Theory Seminars

Speaker: Anannya Upasana, Institute of Mathematical Sciences, Chennai

Date/Time: Apr 29 16:00:00

Location: CSA Auditorium, (Room No. 104, Ground Floor)

Abstract:
Lossy kernelization has emerged as a powerful preprocessing paradigm in parameterized approximation, but existing approaches are largely limited to problems with a single optimization objective. In this talk, we introduce a general framework for lossy kernelization in multi-criteria optimization settings, where multiple constraints must be handled simultaneously. We demonstrate the applicability of this framework via Fair and Matroid Constrained Max k-Weight SAT- a natural generalization of Maximum Coverage that incorporates both fairness constraints and matroid independence.


Microsoft teams link:

Link

We are grateful to the Kirani family (Link and the Walmart Center for Tech Excellence (Link for generously supporting this seminar series


Hosts: Rameesh Paul, Debajyoti Kar, KVN Sreenivas, Nirjhar Das, Rahul Madhavan