# Zachary Friggstad

According to our database

Collaborative distances:

^{1}, Zachary Friggstad authored at least 33 papers between 2005 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Scheduling problems over a network of machines.

J. Scheduling, 2019

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Approximation Algorithms for Minimum-Load

*k*-Facility Location.
ACM Trans. Algorithms, 2018

Orienteering Algorithms for Generating Travel Itineraries.

Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

Approximation Schemes for Clustering with Outliers.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup).

Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

2017

Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing.

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs.

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Scheduling Problems over Network of Machines.

Proceedings of the Approximation, 2017

2016

Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs .

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median.

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Local Search Yields a PTAS for k-Means in Doubling Metrics.

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median.

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

On Linear Programming Relaxations for Unsplittable Flow in Trees.

Proceedings of the Approximation, 2015

Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line.

Proceedings of the Algorithms for Sensor Systems, 2015

2014

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing.

Proceedings of the Symposium on Theory of Computing, 2014

Linear Programming Hierarchies Suffice for Directed Steiner Tree.

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Approximation Algorithms for Minimum-Load k-Facility Location.

Proceedings of the Approximation, 2014

2013

Lift-and-Project Methods for Set Cover and Knapsack.

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Local-Search based Approximation Algorithms for Mobile Facility Location Problems.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

An Improved Integrality Gap for Asymmetric TSP Paths.

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Multiple Traveling Salesmen in Asymmetric Metrics.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Approximating Minimum-Cost Connected T-Joins.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2010

Asymmetric Traveling Salesman Path and Directed Latency Problems.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Superabundant Numbers and the Riemann Hypothesis.

The American Mathematical Monthly, 2009

A logarithmic approximation for unsplittable flow on line graphs.

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Design of Reconfigurable DFA Architecture.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

Minimizing Movement in Mobile Facility Location Problems.

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Explicit upper bounds for f(n)=Π

_{pω(n)}p/p-1.
Contributions to Discrete Mathematics, 2007

Approximability of Packing Disjoint Cycles.

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2005

An efficient architecture for the AES mix columns operation.

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005