Ashlesha Hota

activity

20242026

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

Minimizing Envy and Maximizing Happiness in Graphical House Allocation

Anubhav Dhar, Ashlesha Hota, Palash Dey +1

We study the house allocation problem in a setting where agents are connected by a graph representing friendships. In this model, two agents can only envy each other if they are ne…

cs.DS2025

Knapsack on Graphs with Relaxed Neighborhood Constraints

Palash Dey, Ashlesha Hota, Sudeshna Kolay

In the knapsack problems with neighborhood constraints that were studied before, the input is a graph $G$ on a set $V$ of items, each item $v \in V$ h…

cs.DS2024

Knapsack with Vertex Cover, Set Cover, and Hitting Set

Palash Dey, Ashlesha Hota, Sudeshna Kolay +1

Given an undirected graph $G = (V, E)$ , with vertex weights $(w (u))_{u \in V}$ , vertex values $(α (u))_{u \in V}$ , a knapsack size $s$ , an…