3 citations · 6 across the 10 of their papers we have counts for
15 papers · 1 filter
Clustering under Constraints: Efficient Parameterized Approximation Schemes
Sujoy Bhore, Ameet Gadekar, Tanmay Inamdar
We present a unified framework that yields EPASes for constrained -clustering in metric spaces of bounded (algorithmic) scatter dimension, a notion introduced by Abbasi et a…
Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
Ameet Gadekar, Tanmay Inamdar
Hybrid -Clustering is a model of clustering that generalizes two of the most widely studied clustering objectives: -Center and -Median. In this model, given a set of p…
Hybrid k-Clustering: Blending k-Median and k-Center
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
We propose a novel clustering model encompassing two well-known clustering models: k-center clustering and k-median clustering. In the Hybrid k-Clusetring problem, given a set P of…
When far is better: The Chamberlin-Courant approach to obnoxious committee selection
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain +3
Classical work on metric space based committee selection problem interprets distance as ``near is better''. In this work, motivated by real-life situations, we interpret distance a…
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov +3
In MaxSAT with Cardinality Constraint problem (CC-MaxSAT), we are given a CNF-formula , and , and the goal is to find an assignment with at most variables set t…
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu +2
For numerous graph problems in the realm of parameterized algorithms, using the size of a smallest deletion set (called a modulator) into well-understood graph families as paramete…