Zachary Friggstad
Zachary Friggstad
Assistant Professor at the University of Alberta
Verified email at cs.ualberta.ca
Title
Cited by
Cited by
Year
Local Search Yields a PTAS for -Means in Doubling Metrics
Z Friggstad, M Rezapour, MR Salavatipour
SIAM Journal on Computing 48 (2), 452-480, 2019
832019
Minimizing movement in mobile facility location problems
Z Friggstad, MR Salavatipour
ACM Transactions on Algorithms (TALG) 7 (3), 1-22, 2011
552011
A logarithmic approximation for unsplittable flow on line graphs
N Bansal, Z Friggstad, R Khandekar, MR Salavatipour
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
552009
Local-search based approximation algorithms for mobile facility location problems
S Ahmadian, Z Friggstad, C Swamy
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
282013
Linear programming hierarchies suffice for directed steiner tree
Z Friggstad, J Könemann, Y Kun-Ko, A Louis, M Shadravan, M Tulsiani
International Conference on Integer Programming and Combinatorial …, 2014
222014
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
Z Friggstad, C Swamy
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
222014
Orienteering algorithms for generating travel itineraries
Z Friggstad, S Gollapudi, K Kollias, T Sarlos, C Swamy, A Tomkins
Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018
212018
Approximability of packing disjoint cycles
Z Friggstad, MR Salavatipour
Proceedings of the 18th international conference on Algorithms and …, 2007
182007
Approximation schemes for clustering with outliers
Z Friggstad, K Khodamoradi, M Rezapour, MR Salavatipour
ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019
172019
Asymmetric traveling salesman path and directed latency problems
Z Friggstad, MR Salavatipour, Z Svitkina
SIAM Journal on Computing 42 (4), 1596-1619, 2013
162013
Minimizing total sensor movement for barrier coverage by non-uniform sensors on a line
R Benkoczi, Z Friggstad, D Gaur, M Thom
International Symposium on Algorithms and Experiments for Wireless Sensor …, 2015
132015
Superabundant numbers and the Riemann hypothesis
A Akbary, Z Friggstad
The American Mathematical Monthly 116 (3), 273-275, 2009
132009
Approximability of packing disjoint cycles
Z Friggstad, MR Salavatipour
Algorithmica 60 (2), 395-400, 2011
112011
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
Z Friggstad, K Khodamoradi, MR Salavatipour
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
92019
Approximating minimum-cost connected T-joins
J Cheriyan, Z Friggstad, Z Gao
Algorithmica 72 (1), 126-147, 2015
92015
On linear programming relaxations for unsplittable flow in trees
Z Friggstad, Z Gao
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
92015
A logarithmic approximation for unsplittable flow on line graphs
N Bansal, Z Friggstad, R Khandekar, MR Salavatipour
ACM Transactions on Algorithms (TALG) 10 (1), 1-15, 2014
92014
Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median
Z Friggstad, Y Zhang
arXiv preprint arXiv:1603.00973, 2016
82016
Lift-and-project methods for set cover and knapsack
E Chlamtáč, Z Friggstad, K Georgiou
Workshop on Algorithms and Data Structures, 256-267, 2013
82013
Explicit upper bounds for∏
A Akbary, Z Friggstad, R Juricevic
Contrib. Discrete Math. 2, 153-60, 2007
72007
The system can't perform the operation now. Try again later.
Articles 1–20