フォロー
Zachary Friggstad
Zachary Friggstad
Associate Professor at the University of Alberta
確認したメール アドレス: cs.ualberta.ca
タイトル
引用先
引用先
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
1522019
Minimizing movement in mobile facility location problems
Z Friggstad, MR Salavatipour
ACM Transactions on Algorithms (TALG) 7 (3), 1-22, 2011
802011
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
682009
Approximation schemes for clustering with outliers
Z Friggstad, K Khodamoradi, M Rezapour, MR Salavatipour
ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019
582019
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
562018
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
442013
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
422014
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
342014
Asymmetric traveling salesman path and directed latency problems
Z Friggstad, MR Salavatipour, Z Svitkina
SIAM Journal on Computing 42 (4), 1596-1619, 2013
252013
Superabundant numbers and the Riemann hypothesis
A Akbary, Z Friggstad
The American Mathematical Monthly 116 (3), 273-275, 2009
242009
Minimizing total sensor movement for barrier coverage by non-uniform sensors on a line
R Benkoczi, Z Friggstad, D Gaur, M Thom
Algorithms for Sensor Systems: 11th International Symposium on Algorithms …, 2015
222015
Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
Z Friggstad, C Swamy
International Conference on Integer Programming and Combinatorial …, 2017
202017
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
182019
Approximability of packing disjoint cycles
Z Friggstad, MR Salavatipour
Proceedings of the 18th international conference on Algorithms and …, 2007
182007
Improved polynomial-time approximations for clustering with minimum sum of radii or diameters
Z Friggstad, M Jamshidian
30th Annual European Symposium on Algorithms (ESA 2022), 2022
172022
Tight analysis of a multiple-swap heuristic for budgeted red-blue median
Z Friggstad, Y Zhang
arXiv preprint arXiv:1603.00973, 2016
162016
On linear programming relaxations for unsplittable flow in trees
Z Friggstad, Z Gao
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015
162015
Approximability of packing disjoint cycles
Z Friggstad, MR Salavatipour
Algorithmica 60 (2), 395-400, 2011
162011
Improved approximations for capacitated vehicle routing with unsplittable client demands
Z Friggstad, R Mousavi, M Rahgoshay, MR Salavatipour
International Conference on Integer Programming and Combinatorial …, 2022
142022
Approximating connected facility location with lower and upper bounds via LP rounding
Z Friggstad, M Rezapour, MR Salavatipour
15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), 2016
142016
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20