Zachary Friggstad

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 58

Top Topics

Integrality Gap

Facility Location

Approximation Algorithms

Top Venues

Publications

Zachary Friggstad, Hao Sun
A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree. SWAT (2024)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun
A QPTAS for Facility Location on Unit Disk graphs. CoRR (2024)
Ian DeHaan, Zachary Friggstad
-Colorable Subgraphs of Chordal Graphs. CoRR (2024)
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. Algorithmica 86 (8) (2024)
Seyed Parsa Darbouy, Zachary Friggstad
Approximating Minimum Sum Coloring with Bundles. SWAT (2024)
Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase
Approximating TSP Variants Using a Bridge Lemma. CoRR (2024)
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. WADS (2023)
Zachary Friggstad, Ramin Mousavi
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. APPROX/RANDOM (2023)
Zachary Friggstad, Ramin Mousavi
An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. ICALP (2023)
Zachary Friggstad, Ramin Mousavi
An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs. CoRR (2023)
Ian DeHaan, Zachary Friggstad
Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. WADS (2023)
Zachary Friggstad, Mahya Jamshidian
Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. ESA (2022)
Dylan R. Ashley, Vincent Herrmann, Zachary Friggstad, Jürgen Schmidhuber
On Narrative Information and the Distillation of Stories. CoRR (2022)
Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. IPCO (2022)
Zachary Friggstad, Ramin Mousavi
Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. ISAAC (2022)
Jean-Lou De Carufel, Zachary Friggstad
Preface. Comput. Geom. 101 (2022)
Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. IPCO (2022)
Zachary Friggstad, Chaitanya Swamy
A constant-factor approximation for directed latency in quasi-polynomial time. J. Comput. Syst. Sci. 126 (2022)
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
Parameterized Approximation Algorithms for K-center Clustering and Variants. AAAI (2022)
Zachary Friggstad, Chaitanya Swamy
Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. ICALP (2021)
Zachary Friggstad, Maryam Mahboub
Graph Pricing with Limited Supply. WADS (2021)
Zachary Friggstad, Ramin Mousavi
Fair Correlation Clustering with Global and Local Guarantees. WADS (2021)
Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour
Special Issue on Algorithms and Data Structures (WADS 2019). Algorithmica 83 (3) (2021)
Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
Improved Approximations for CVRP with Unsplittable Demands. CoRR (2021)
Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. CoRR (2021)
Zachary Friggstad, Ramin Mousavi
A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs. CoRR (2021)
Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi
Parameterized Approximation Algorithms for k-Center Clustering and Variants. CoRR (2021)
Dylan R. Ashley, Vincent Herrmann, Zachary Friggstad, Kory W. Mathewson, Jürgen Schmidhuber
Automatic Embedding of Stories Into Collections of Independent Media. CoRR (2021)
Zachary Friggstad, Chaitanya Swamy
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. ESA (2020)
Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour
Preface. Comput. Geom. 91 (2020)
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour
Approximation Schemes for Clustering with Outliers. ACM Trans. Algorithms 15 (2) (2019)
Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS. SODA (2019)
Zachary Friggstad, Maryam Mahboub
Graph Pricing with Limited Supply. CoRR (2019)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Local Search Yields a PTAS for k-Means in Doubling Metrics. SIAM J. Comput. 48 (2) (2019)
Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. Algorithmica 81 (3) (2019)
Zachary Friggstad, Chaitanya Swamy
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. CoRR (2019)
Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang
Scheduling problems over a network of machines. J. Sched. 22 (2) (2019)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. Algorithmica 81 (3) (2019)
Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou
Lift-and-Project Methods for Set Cover and Knapsack. Algorithmica 80 (12) (2018)
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour
Approximation Schemes for Clustering with Outliers. SODA (2018)
Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy
-Facility Location. ACM Trans. Algorithms 14 (2) (2018)
Zachary Friggstad, Sreenivas Gollapudi, Kostas Kollias, Tamás Sarlós, Chaitanya Swamy, Andrew Tomkins
Orienteering Algorithms for Generating Travel Itineraries. WSDM (2018)
Zach Goldthorpe, Jason Cannon, Jesse Farebrother, Zachary Friggstad, Mario A. Nascimento
Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup). SIGSPATIAL/GIS (2018)
Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means. CoRR (2018)
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour
Approximation Schemes for Clustering with Outliers. CoRR (2017)
Zachary Friggstad, Chaitanya Swamy
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. IPCO (2017)
Sara Ahmadian, Zachary Friggstad
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. ICALP (2017)
Sara Ahmadian, Zachary Friggstad
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. CoRR (2017)
Zachary Friggstad, Chaitanya Swamy
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. CoRR (2017)
Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang
Scheduling Problems over Network of Machines. APPROX-RANDOM (2017)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. SWAT (2016)
Zachary Friggstad, Yifeng Zhang
Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median. CoRR (2016)
Zachary Friggstad, Yifeng Zhang
Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median. ICALP (2016)
Zachary Friggstad, Anupam Gupta, Mohit Singh
An Improved Integrality Gap for Asymmetric TSP Paths. Math. Oper. Res. 41 (3) (2016)
Zachary Friggstad, Jochen Könemann, Mohammad Shadravan
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs . SWAT (2016)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Local Search Yields a PTAS for k-Means in Doubling Metrics. FOCS (2016)
Zachary Friggstad, Jochen Könemann, Mohammad Shadravan
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs. CoRR (2016)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Local Search Yields a PTAS for k-Means in Doubling Metrics. CoRR (2016)
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao
Approximating Minimum-Cost Connected T-Joins. Algorithmica 72 (1) (2015)
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. WADS (2015)
Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. ICALP (1) (2015)
Zachary Friggstad, Zhihan Gao
On Linear Programming Relaxations for Unsplittable Flow in Trees. APPROX-RANDOM (2015)
Robert Benkoczi, Zachary Friggstad, Daya Ram Gaur, Mark Thom
Minimizing Total Sensor Movement for Barrier Coverage by Non-uniform Sensors on a Line. ALGOSENSORS (2015)
Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
A logarithmic approximation for unsplittable flow on line graphs. ACM Trans. Algorithms 10 (1) (2014)
Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani
Linear Programming Hierarchies Suffice for Directed Steiner Tree. IPCO (2014)
Zachary Friggstad, Chaitanya Swamy
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. STOC (2014)
Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy
Approximation Algorithms for Minimum-Load k-Facility Location. APPROX-RANDOM (2014)
Zachary Friggstad
Multiple Traveling Salesmen in Asymmetric Metrics. APPROX-RANDOM (2013)
Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy
Local-Search based Approximation Algorithms for Mobile Facility Location Problems CoRR (2013)
Zachary Friggstad, Anupam Gupta, Mohit Singh
An Improved Integrality Gap for Asymmetric TSP Paths. IPCO (2013)
Zachary Friggstad, Chaitanya Swamy
Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications to Distance-Constrained Vehicle Routing. CoRR (2013)
Zachary Friggstad, Anupam Gupta, Mohit Singh
An Improved Integrality Gap for Asymmetric TSP Paths CoRR (2013)
Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy
Local-Search based Approximation Algorithms for Mobile Facility Location Problems. SODA (2013)
Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina
Asymmetric Traveling Salesman Path and Directed Latency Problems. SIAM J. Comput. 42 (4) (2013)
Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou
Lift-and-Project Methods for Set Cover and Knapsack. WADS (2013)
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao
Approximating Minimum-Cost Connected T-Joins. APPROX-RANDOM (2012)
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao
Approximating Minimum-Cost Connected T-Joins CoRR (2012)
Zachary Friggstad, Mohammad R. Salavatipour
Minimizing movement in mobile facility location problems. ACM Trans. Algorithms 7 (3) (2011)
Zachary Friggstad, Mohammad R. Salavatipour
Approximability of Packing Disjoint Cycles. Algorithmica 60 (2) (2011)
Zachary Friggstad
Multiple Traveling Salesmen in Asymmetric Metrics CoRR (2011)
Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina
Asymmetric Traveling Salesman Path and Directed Latency Problems. SODA (2010)
Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina
Asymmetric Traveling Salesman Path and Directed Latency Problems CoRR (2009)
Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour
A logarithmic approximation for unsplittable flow on line graphs. SODA (2009)
Amir Akbary, Zachary Friggstad
Superabundant Numbers and the Riemann Hypothesis. Am. Math. Mon. 116 (3) (2009)
Hua Li, Zachary Friggstad, F. M. Wang
Design of Reconfigurable DFA Architecture. PDPTA (2008)
Zachary Friggstad, Mohammad R. Salavatipour
Minimizing Movement in Mobile Facility Location Problems. FOCS (2008)
Amir Akbary, Zachary Friggstad, Robert Juricevic
p/p-1. Contributions Discret. Math. 2 (2) (2007)
Zachary Friggstad, Mohammad R. Salavatipour
Approximability of Packing Disjoint Cycles. ISAAC (2007)
Hua Li, Zachary Friggstad
An efficient architecture for the AES mix columns operation. ISCAS (5) (2005)