Zachary Friggstad

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Zhihan Gao 0002

> Home > Persons > Zachary Friggstad

Publications

2015
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/CheriyanFG15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/CheriyanFG15
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. Algorithmica 72(1): 126-147 (2015)
[c17]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/approx/FriggstadG15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/FriggstadG15
Zachary Friggstad, Zhihan Gao:
On Linear Programming Relaxations for Unsplittable Flow in Trees. APPROX-RANDOM 2015: 265-283
2012
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/CheriyanFG12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/CheriyanFG12
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. APPROX-RANDOM 2012: 110-121
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1207-5722
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1207-5722
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao:
Approximating Minimum-Cost Connected T-Joins. CoRR abs/1207.5722 (2012)

a service of

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.