34 citations · 47 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013
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…
cs.DM2008
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…