Zachary Friggstad

Orcid: 0000-0003-4039-3235

According to our database1, Zachary Friggstad authored at least 53 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Parameterized Approximation Scheme for Generalized Partial Vertex Cover.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs.
Proceedings of the Approximation, 2023

2022
A constant-factor approximation for directed latency in quasi-polynomial time.
J. Comput. Syst. Sci., 2022

On Narrative Information and the Distillation of Stories.
CoRR, 2022

Preface.
Comput. Geom., 2022

Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Parameterized Approximation Algorithms for K-center Clustering and Variants.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Improved Approximations for CVRP with Unsplittable Demands.
CoRR, 2021

Automatic Embedding of Stories Into Collections of Independent Media.
CoRR, 2021

Special Issue on Algorithms and Data Structures (WADS 2019).
Algorithmica, 2021

Fair Correlation Clustering with Global and Local Guarantees.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Graph Pricing with Limited Supply.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Preface.
Comput. Geom., 2020

2019
Approximation Schemes for Clustering with Outliers.
ACM Trans. Algorithms, 2019

Local Search Yields a PTAS for k-Means in Doubling Metrics.
SIAM J. Comput., 2019

Scheduling problems over a network of machines.
J. Sched., 2019

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

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median.
Algorithmica, 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 <i>k</i>-Facility Location.
ACM Trans. Algorithms, 2018

Lift-and-Project Methods for Set Cover and Knapsack.
Algorithmica, 2018

Orienteering Algorithms for Generating Travel Itineraries.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 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

2016
An Improved Integrality Gap for Asymmetric TSP Paths.
Math. Oper. Res., 2016

Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median.
CoRR, 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

2015
Approximating Minimum-Cost Connected T-Joins.
Algorithmica, 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
A logarithmic approximation for unsplittable flow on line graphs.
ACM Trans. Algorithms, 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
Asymmetric Traveling Salesman Path and Directed Latency Problems.
SIAM J. Comput., 2013

Local-Search based Approximation Algorithms for Mobile Facility Location Problems.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Multiple Traveling Salesmen in Asymmetric Metrics.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods
CoRR, 2012

2011
Minimizing movement in mobile facility location problems.
ACM Trans. Algorithms, 2011

Approximability of Packing Disjoint Cycles.
Algorithmica, 2011

2009
Superabundant Numbers and the Riemann Hypothesis.
Am. Math. Mon., 2009

2008
Design of Reconfigurable DFA Architecture.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

2007
Explicit upper bounds for f(n)=Π<sub>p<sub>ω(n)</sub></sub> p/p-1.
Contributions Discret. Math., 2007

2005
An efficient architecture for the AES mix columns operation.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005


  Loading...