6 citations · 14 across the 22 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing
Zachary Friggstad, Chaitanya Swamy
We develop polynomial-size LP-relaxations for {\em orienteering} and the {\em regret-bounded vehicle routing problem} (\rvrp) and devise suitable LP-rounding algorithms that lead t…
cs.DS2017
Approximation Schemes for Clustering with Outliers
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour +1
Clustering problems are well-studied in a variety of fields such as data science, operations research, and computer science. Such problems include variants of centre location probl…
cs.DS2017★ 1 cited
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs
Sara Ahmadian, Zachary Friggstad
We pursue a study of the Generalized Demand Matching problem, a common generalization of the -Matching and Knapsack problems. Here, we are given a graph with vertex capacities,…