ZF

Zachary Friggstad

cs.DScs.AIcs.LGcs.CLcs.DMcs.MMcs.SDeess.AScs.CGcs.NE

On Valency

published · living versions
W_de48umdj·v1 · currentpublished

Preprints & journals

29 papers in the corpus · 2009–2025
Approximating Traveling Salesman Problems Using a Bridge Lemma2405.12876v3 · Martin Bohm, Zachary Friggstad, Tobias Momke et al.2024 · 1 citationarXiv
Budget-constrained Active Learning to Effectively De-censor Survival Data2510.12144v1 · Ali Parsaee, Bei Jiang, Zachary Friggstad et al.2025 · 0 citationsarXiv
Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding2510.05321v1 · Zachary Friggstad, Tobias Momke2025 · 0 citationsarXiv
On the Distillation of Stories for Transferring Narrative Arcs in Collections of Independent Media.39446544 · Ashley, Dylan R, Herrmann, Vincent, Friggstad, Zachary et al.2025 · 0 citationsIEEE transactions on pattern analysis and machine intelligence. 2025;47(2):697-707
A QPTAS for Facility Location on Unit Disk graphs2405.08931v1 · Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour et al.2024 · 0 citationsarXiv
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means1807.05443v3 · Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour2018 · 12 citationsarXiv
An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs2302.04747v2 · Zachary Friggstad, Ramin Mousavi2023 · 1 citationarXiv
On Narrative Information and the Distillation of Stories2211.12423v2 · Dylan R. Ashley, Vincent Herrmann, Zachary Friggstad et al.2022 · 0 citationsarXiv
Parameterized Approximation Algorithms for $k$-Center Clustering and Variants2112.10195v1 · Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi2021 · 6 citationsarXiv
Improved Approximations for CVRP with Unsplittable Demands2111.08138v1 · Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay et al.2021 · 0 citationsarXiv
Automatic Embedding of Stories Into Collections of Independent Media2111.02216v1 · Dylan R. Ashley, Vincent Herrmann, Zachary Friggstad et al.2021 · 0 citationsarXiv
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time1912.06198v2 · Zachary Friggstad, Chaitanya Swamy2019 · 1 citationarXiv
Graph Pricing with Limited Supply1912.05010v1 · Zachary Friggstad, Maryam Mahboub2019 · 1 citationarXiv
Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing1708.01335v1 · Zachary Friggstad, Chaitanya Swamy2017 · 9 citationsarXiv
Approximation Schemes for Clustering with Outliers1707.04295v1 · Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour et al.2017 · 44 citationsarXiv
Local Search Yields a PTAS for k-Means in Doubling Metrics1603.08976v2 · Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour2016 · 120 citationsarXiv
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs1604.08132v1 · Zachary Friggstad, Jochen Koenemann, Mohammad Shadravan2016 · 3 citationsarXiv
Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median1603.00973v1 · Zachary Friggstad, Yifeng Zhang2016 · 6 citationsarXiv
An Improved Integrality Gap for Asymmetric TSP Paths1302.3145v2 · Zachary Friggstad, Anupam Gupta, Mohit Singh2013 · 5 citationsarXiv
Local-Search based Approximation Algorithms for Mobile Facility Location Problems1301.4478v1 · Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy2013 · 32 citationsarXivon Valency
Approximating Minimum-Cost Connected T-Joins1207.5722v1 · Joseph Cheriyan, Zachary Friggstad, Zhihan Gao2012 · 13 citationsarXiv
Multiple Traveling Salesmen in Asymmetric Metrics1112.2930v2 · Zachary Friggstad2011 · 8 citationsarXiv
Asymmetric Traveling Salesman Path and Directed Latency Problems0907.0726v2 · Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina2009 · 10 citationsarXiv
Career total: 100 works. 29 are in this corpus.

Profile built from the corpus for this byline.

Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.