117 citations · 273 across the 35 of their papers we have counts for
4 papers · 1 filter
Min-Max Graph Partitioning and Small Set Expansion
Nikhil Bansal, Uriel Feige, Robert Krauthgamer +5
We study graph partitioning problems from a min-max perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maxi…
Minimum Latency Submodular Cover
Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan
We study the Minimum Latency Submodular Cover problem (MLSC), which consists of a metric with source and monotone submodular functions $f_1, f_2, ..., f_m: 2^V…
Locating Depots for Capacitated Vehicle Routing
Inge Li Goertz, Viswanath Nagarajan
We study a location-routing problem in the context of capacitated vehicle routing. The input is a set of demand locations in a metric space and a fleet of k vehicles each of capaci…
Minimum Makespan Multi-vehicle Dial-a-Ride
Inge Li Goertz, Viswanath Nagarajan, R. Ravi
Dial a ride problems consist of a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs, where each object requires to…