6 citations · 14 across the 22 of their papers we have counts for
Showing 2013 · cs.DSShow all
3 papers · 2 filters
cs.DS2013
Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications to Distance-Constrained Vehicle Routing
Zachary Friggstad, Chaitanya Swamy
We consider vehicle-routing problems (VRPs) that incorporate the notion of {\em regret} of a client, which is a measure of the waiting time of a client relative to its shortest-pat…
cs.DS2013
An Improved Integrality Gap for Asymmetric TSP Paths
Zachary Friggstad, Anupam Gupta, Mohit Singh
The Asymmetric Traveling Salesperson Path Problem (ATSPP) is one where, given an asymmetric metric space with specified vertices s and t, the goal is to find an s-t path of…
cs.DS2013
Local-Search based Approximation Algorithms for Mobile Facility Location Problems
Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy
We consider the {\em mobile facility location} (\mfl) problem. We are given a set of facilities and clients located in a common metric space. The goal is to move each facility from…