About
Zachary Friggstad is an Associate Professor in the Department of Computing Science at the University of Alberta. His research focuses on algorithm design for discrete optimization problems, including vehicle routing, facility placement, and scheduling. He specializes in approximation algorithms with proven performance guarantees, often leveraging convex relaxations like linear and semidefinite programming.
Education:
- B.Sc. in Computing Science, University of Lethbridge, 2005
- M.Sc. in Computing Science, University of Alberta, 2007
- Ph.D. in Computing Science, University of Alberta, 2011
Research Interests:
- Discrete Optimization
- Approximation Algorithms
- Mathematical Programming
- Algorithm Design for NP-Hard Problems
- Graph Algorithms and Combinatorial Optimization
His publications span over 50 works, with recent trends emphasizing fair clustering algorithms, TSP approximations, and narrative distillation in cross-media contexts. No scientific awards are explicitly listed in the provided text. He has advised no students in the listed records. His work bridges theoretical computer science and practical algorithmic solutions for complex optimization challenges.
Find Zachary Friggstad elsewhere
Related Searches
You Might Also Like
Michel GoemansMassachusetts Institute of Technology · Professor- MMohammad SalavatipourUniversity of Alberta · Professor
Stefan HougardyRhenish Friedrich Wilhelm University of Bonn · Professor
David P. WilliamsonCornell University · Professor- KKolliopoulos StavrosNational and Kapodistrian University of Athens · Professor
William CookUniversity of Waterloo · Professor