2 papers
cs.DS2024
Budget-feasible Egalitarian Allocation of Conflicting Jobs
Sushmita Gupta, Pallavi Jain, A. Mohanapriya +1
Allocating conflicting jobs among individuals while respecting a budget constraint for each individual is an optimization problem that arises in various real-world scenarios. In th…
cs.DM2021
Complexity of Paired Domination in AT-free and Planar Graphs
Vikash Tripathi, Ton Kloks, Arti Pandey +2
For a graph , a subset of vertex set , is a dominating set of if every vertex not in is adjacent to atleast one vertex of . A dominating set of a gra…