default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZachary Friggstad
Zac Friggstad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j21]Dylan R. Ashley
, Vincent Herrmann, Zachary Friggstad, Jürgen Schmidhuber:
On the Distillation of Stories for Transferring Narrative Arcs in Collections of Independent Media. IEEE Trans. Pattern Anal. Mach. Intell. 47(2): 697-707 (2025)- [c45]Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase:
Approximating Traveling Salesman Problems Using a Bridge Lemma. SODA 2025: 1166-1177 - 2024
- [j20]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. Algorithmica 86(8): 2557-2574 (2024) - [c44]Seyed Parsa Darbouy, Zachary Friggstad:
Approximating Minimum Sum Coloring with Bundles. SWAT 2024: 21:1-21:14 - [c43]Zachary Friggstad, Hao Sun:
A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree. SWAT 2024: 23:1-23:15 - [i27]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun:
A QPTAS for Facility Location on Unit Disk graphs. CoRR abs/2405.08931 (2024) - [i26]Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase:
Approximating TSP Variants Using a Bridge Lemma. CoRR abs/2405.12876 (2024) - [i25]Ian DeHaan, Zachary Friggstad:
Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. CoRR abs/2406.18835 (2024) - [i24]Zachary Friggstad, Mahya Jamshidian:
Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii. CoRR abs/2412.16327 (2024) - 2023
- [c42]Zachary Friggstad, Ramin Mousavi:
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. APPROX/RANDOM 2023: 13:1-13:18 - [c41]Zachary Friggstad, Ramin Mousavi:
An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs. ICALP 2023: 63:1-63:14 - [c40]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. WADS 2023: 93-105 - [c39]Ian DeHaan, Zachary Friggstad:
Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. WADS 2023: 326-339 - [i23]Zachary Friggstad, Ramin Mousavi:
An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs. CoRR abs/2302.04747 (2023) - 2022
- [j19]Jean-Lou De Carufel, Zachary Friggstad:
Preface. Comput. Geom. 101: 101776 (2022) - [j18]Zachary Friggstad, Chaitanya Swamy:
A constant-factor approximation for directed latency in quasi-polynomial time. J. Comput. Syst. Sci. 126: 44-58 (2022) - [c38]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms for K-center Clustering and Variants. AAAI 2022: 3895-3903 - [c37]Zachary Friggstad, Mahya Jamshidian:
Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. ESA 2022: 56:1-56:14 - [c36]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: 195-209 - [c35]Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands. IPCO 2022: 251-261 - [c34]Zachary Friggstad, Ramin Mousavi:
Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP. ISAAC 2022: 8:1-8:17 - [i22]Dylan R. Ashley, Vincent Herrmann, Zachary Friggstad, Jürgen Schmidhuber:
On Narrative Information and the Distillation of Stories. CoRR abs/2211.12423 (2022) - 2021
- [j17]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Special Issue on Algorithms and Data Structures (WADS 2019). Algorithmica 83(3): 775 (2021) - [c33]Zachary Friggstad, Chaitanya Swamy:
Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. ICALP 2021: 67:1-67:21 - [c32]Zachary Friggstad, Maryam Mahboub:
Graph Pricing with Limited Supply. WADS 2021: 399-413 - [c31]Zachary Friggstad, Ramin Mousavi:
Fair Correlation Clustering with Global and Local Guarantees. WADS 2021: 414-427 - [i21]Dylan R. Ashley, Vincent Herrmann, Zachary Friggstad, Kory W. Mathewson, Jürgen Schmidhuber:
Automatic Embedding of Stories Into Collections of Independent Media. CoRR abs/2111.02216 (2021) - [i20]Zachary Friggstad, Ramin Mousavi:
A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs. CoRR abs/2111.02572 (2021) - [i19]Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy:
Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. CoRR abs/2111.07414 (2021) - [i18]Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Improved Approximations for CVRP with Unsplittable Demands. CoRR abs/2111.08138 (2021) - [i17]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms for k-Center Clustering and Variants. CoRR abs/2112.10195 (2021) - 2020
- [j16]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Preface. Comput. Geom. 91: 101671 (2020) - [c30]Zachary Friggstad, Chaitanya Swamy:
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. ESA 2020: 52:1-52:20
2010 – 2019
- 2019
- [j15]Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar:
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. Algorithmica 81(3): 1006-1030 (2019) - [j14]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): 1075-1095 (2019) - [j13]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): 239-253 (2019) - [j12]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Local Search Yields a PTAS for k-Means in Doubling Metrics. SIAM J. Comput. 48(2): 452-480 (2019) - [j11]Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. ACM Trans. Algorithms 15(2): 26:1-26:26 (2019) - [c29]Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour:
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS. SODA 2019: 2958-2972 - [e2]Zachary Friggstad, Jean-Lou De Carufel:
Proceedings of the 31st Canadian Conference on Computational Geometry, CCCG 2019, August 8-10, 2019, University of Alberta, Edmonton, Alberta, Canada. 2019 [contents] - [e1]Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour:
Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings. Lecture Notes in Computer Science 11646, Springer 2019, ISBN 978-3-030-24765-2 [contents] - [i16]Zachary Friggstad, Maryam Mahboub:
Graph Pricing with Limited Supply. CoRR abs/1912.05010 (2019) - [i15]Zachary Friggstad, Chaitanya Swamy:
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. CoRR abs/1912.06198 (2019) - 2018
- [j10]Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou:
Lift-and-Project Methods for Set Cover and Knapsack. Algorithmica 80(12): 3920-3942 (2018) - [j9]Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. ACM Trans. Algorithms 14(2): 16:1-16:29 (2018) - [c28]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: 630-633 - [c27]Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. SODA 2018: 398-414 - [c26]Zachary Friggstad, Sreenivas Gollapudi, Kostas Kollias, Tamás Sarlós, Chaitanya Swamy, Andrew Tomkins:
Orienteering Algorithms for Generating Travel Itineraries. WSDM 2018: 180-188 - [i14]Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour:
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means. CoRR abs/1807.05443 (2018) - 2017
- [c25]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: 5:1-5:18 - [c24]Sara Ahmadian, Zachary Friggstad:
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. ICALP 2017: 55:1-55:13 - [c23]Zachary Friggstad, Chaitanya Swamy:
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. IPCO 2017: 199-211 - [i13]Sara Ahmadian, Zachary Friggstad:
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. CoRR abs/1705.10396 (2017) - [i12]Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. CoRR abs/1707.04295 (2017) - [i11]Zachary Friggstad, Chaitanya Swamy:
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. CoRR abs/1708.01335 (2017) - 2016
- [j8]Zachary Friggstad, Anupam Gupta, Mohit Singh:
An Improved Integrality Gap for Asymmetric TSP Paths. Math. Oper. Res. 41(3): 745-757 (2016) - [c22]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Local Search Yields a PTAS for k-Means in Doubling Metrics. FOCS 2016: 365-374 - [c21]Zachary Friggstad, Yifeng Zhang:
Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median. ICALP 2016: 75:1-75:13 - [c20]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. SWAT 2016: 1:1-1:14 - [c19]Zachary Friggstad, Jochen Könemann, Mohammad Shadravan:
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs . SWAT 2016: 3:1-3:11 - [i10]Zachary Friggstad, Yifeng Zhang:
Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median. CoRR abs/1603.00973 (2016) - [i9]Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour:
Local Search Yields a PTAS for k-Means in Doubling Metrics. CoRR abs/1603.08976 (2016) - [i8]Zachary Friggstad, Jochen Könemann, Mohammad Shadravan:
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs. CoRR abs/1604.08132 (2016) - 2015
- [j7]Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. Algorithmica 72(1): 126-147 (2015) - [c18]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: 98-111 - [c17]Zachary Friggstad, Zhihan Gao:
On Linear Programming Relaxations for Unsplittable Flow in Trees. APPROX-RANDOM 2015: 265-283 - [c16]Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar:
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. ICALP (1) 2015: 116-128 - [c15]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: 373-385 - 2014
- [j6]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. ACM Trans. Algorithms 10(1): 1:1-1:15 (2014) - [c14]Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. APPROX-RANDOM 2014: 17-33 - [c13]Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, Madhur Tulsiani:
Linear Programming Hierarchies Suffice for Directed Steiner Tree. IPCO 2014: 285-296 - [c12]Zachary Friggstad, Chaitanya Swamy:
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. STOC 2014: 744-753 - 2013
- [j5]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. SIAM J. Comput. 42(4): 1596-1619 (2013) - [c11]Zachary Friggstad:
Multiple Traveling Salesmen in Asymmetric Metrics. APPROX-RANDOM 2013: 173-188 - [c10]Zachary Friggstad, Anupam Gupta, Mohit Singh:
An Improved Integrality Gap for Asymmetric TSP Paths. IPCO 2013: 181-192 - [c9]Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy:
Local-Search based Approximation Algorithms for Mobile Facility Location Problems. SODA 2013: 1607-1621 - [c8]Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou:
Lift-and-Project Methods for Set Cover and Knapsack. WADS 2013: 256-267 - [i7]Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy:
Local-Search based Approximation Algorithms for Mobile Facility Location Problems. CoRR abs/1301.4478 (2013) - [i6]Zachary Friggstad, Anupam Gupta, Mohit Singh:
An Improved Integrality Gap for Asymmetric TSP Paths. CoRR abs/1302.3145 (2013) - [i5]Zachary Friggstad, Chaitanya Swamy:
Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications to Distance-Constrained Vehicle Routing. CoRR abs/1311.6024 (2013) - 2012
- [c7]Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. APPROX-RANDOM 2012: 110-121 - [i4]Eden Chlamtác, Zac Friggstad, Konstantinos Georgiou:
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods. CoRR abs/1204.5489 (2012) - [i3]Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. CoRR abs/1207.5722 (2012) - 2011
- [j4]Zachary Friggstad, Mohammad R. Salavatipour:
Approximability of Packing Disjoint Cycles. Algorithmica 60(2): 395-400 (2011) - [j3]Zachary Friggstad, Mohammad R. Salavatipour:
Minimizing movement in mobile facility location problems. ACM Trans. Algorithms 7(3): 28:1-28:22 (2011) - [i2]Zachary Friggstad:
Multiple Traveling Salesmen in Asymmetric Metrics. CoRR abs/1112.2930 (2011) - 2010
- [c6]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. SODA 2010: 419-428
2000 – 2009
- 2009
- [j2]Amir Akbary, Zachary Friggstad:
Superabundant Numbers and the Riemann Hypothesis. Am. Math. Mon. 116(3): 273-275 (2009) - [c5]Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs. SODA 2009: 702-709 - [i1]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. CoRR abs/0907.0726 (2009) - 2008
- [c4]Zachary Friggstad, Mohammad R. Salavatipour:
Minimizing Movement in Mobile Facility Location Problems. FOCS 2008: 357-366 - [c3]Hua Li, Zachary Friggstad, Fang M. Wang:
Design of Reconfigurable DFA Architecture. PDPTA 2008: 143-148 - 2007
- [j1]Amir Akbary, Zachary Friggstad, Robert Juricevic:
Explicit upper bounds for f(n)=Πpω(n) p/p-1. Contributions Discret. Math. 2(2) (2007) - [c2]Zachary Friggstad, Mohammad R. Salavatipour:
Approximability of Packing Disjoint Cycles. ISAAC 2007: 304-315 - 2005
- [c1]Hua Li, Zachary Friggstad:
An efficient architecture for the AES mix columns operation. ISCAS (5) 2005: 4637-4640
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 01:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
