34 citations · 47 across the 5 of their papers we have counts for
5 papers
On Maximum Differential Coloring of Planar Graphs
M. Bekos, A. Das, M. Geyer +3
We study the \emph{maximum differential coloring problem}, where the vertices of an -vertex graph must be labeled with distinct numbers ranging from to , so that the mini…
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
Aparna Das, Krzysztof Fleszar, Stephen Kobourov +3
Given a set of terminals, which are points in -dimensional Euclidean space, the minimum Manhattan network problem (MMN) asks for a minimum-length rectilinear network that co…
Approximating Minimum Manhattan Networks in Higher Dimensions
Aparna Das, Emden R. Gansner, Michael Kaufmann +3
We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called \emph{terminals} in , find a minimum-length network such that each p…
Maximizing profit using recommender systems
Aparna Das, Claire Mathieu, Daniel Ricketts
Traditional recommendation systems make recommendations based solely on the customer's past purchases, product ratings and demographic data without considering the profitability th…
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
Aparna Das, Claire Mathieu
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, and…