default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathan Klein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Leonid Gurvits, Nathan Klein
, Jonathan Leake:
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. ICALP 2024: 79:1-79:20- [c14]Jannis Blauth, Nathan Klein, Martin Nägele:
A Better-Than-1.6-Approximation for Prize-Collecting TSP. IPCO 2024: 28-42 - [c13]Billy Jin, Nathan Klein, David P. Williamson:
A Lower Bound for the Max Entropy Algorithm for TSP. IPCO 2024: 238-251 - [c12]D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen:
Ghost Value Augmentation for k-Edge-Connectivity. STOC 2024: 1853-1864 - 2023
- [c11]Nathan Klein, Neil Olver:
Thin Trees for Laminar Families. FOCS 2023: 50-59 - [c10]Dorna Abdolazimi, Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
Matroid Partition Property and the Secretary Problem. ITCS 2023: 2:1-2:9 - [c9]Billy Jin, Nathan Klein, David P. Williamson:
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. IPCO 2023: 217-230 - [c8]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP. IPCO 2023: 261-274 - [i13]Nathan Klein, Neil Olver:
Thin trees for laminar families. CoRR abs/2304.07674 (2023) - [i12]Jannis Blauth, Nathan Klein, Martin Nägele:
A Better-Than-1.6-Approximation for Prize-Collecting TSP. CoRR abs/2308.06254 (2023) - [i11]Billy Jin, Nathan Klein, David P. Williamson:
A Lower Bound for the Max Entropy Algorithm for TSP. CoRR abs/2311.01950 (2023) - [i10]Leonid Gurvits, Nathan Klein, Jonathan Leake:
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. CoRR abs/2311.09072 (2023) - [i9]D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen:
Ghost Value Augmentation for k-ECSS and k-ECSM. CoRR abs/2311.09941 (2023) - [i8]Leonid Gurvits, Nathan Klein, Jonathan Leake:
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c7]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP. FOCS 2022: 832-843 - [c6]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi Zhang:
An improved approximation algorithm for the minimum k-edge connected multi-subgraph problem. STOC 2022: 1612-1620 - [i7]Billy Jin, Nathan Klein, David P. Williamson:
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. CoRR abs/2211.04639 (2022) - [i6]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A (Slightly) Improved Deterministic Approximation Algorithm for Metric TSP. CoRR abs/2212.06296 (2022) - 2021
- [c5]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A (slightly) improved approximation algorithm for metric TSP. STOC 2021: 32-45 - [i5]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi Zhang:
An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem. CoRR abs/2101.05921 (2021) - [i4]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP. CoRR abs/2105.10043 (2021) - [i3]Dorna Abdolazimi, Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
Matroid Partition Property and the Secretary Problem. CoRR abs/2111.12436 (2021) - 2020
- [c4]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
An improved approximation algorithm for TSP in the half integral case. STOC 2020: 28-39 - [i2]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
A (Slightly) Improved Approximation Algorithm for Metric TSP. CoRR abs/2007.01409 (2020)
2010 – 2019
- 2019
- [i1]Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan:
An Improved Approximation Algorithm for TSP in the Half Integral Case. CoRR abs/1908.00227 (2019) - 2017
- [c3]Cody Freitag, Jonathan Katz, Nathan Klein:
Symmetric-Key Broadcast Encryption: The Multi-sender Case. CSCML 2017: 200-214 - 2014
- [c2]Nathan Klein, Christopher S. Corley, Nicholas A. Kraft:
New features for duplicate bug detection. MSR 2014: 324-327
2000 – 2009
- 2008
- [c1]Kyle Hurst, Nathan Klein, Mario Feliciano, Steven Warner, Scott Crino:
Feasibility study for replacing the MK19 automatic grenade launching system. WSC 2008: 1179-1185
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 2024-08-05 21:11 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:
