default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLee-Ad Gottlieb
- > Home > Persons > Lee-Ad Gottlieb
Publications
- 2021
[c23]Yair Bartal, Lee-Ad Gottlieb:
Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. STOC 2021: 1028-1041- 2019
- [j15]Yair Bartal, Lee-Ad Gottlieb
:
Approximate nearest neighbor search for ℓp-spaces (2<p<∞). Theor. Comput. Sci. 757: 27-35 (2019) - [i19]Lee-Ad Gottlieb, Yair Bartal:
Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces. CoRR abs/1904.03611 (2019) - 2018
- [c21]Yair Bartal, Lee-Ad Gottlieb:
Approximate Nearest Neighbor Search for \ell _p -Spaces (2 via Embeddings. LATIN 2018: 120-133 - 2016
- [j10]Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer:
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. SIAM J. Comput. 45(4): 1563-1581 (2016) - [c18]Yair Bartal, Lee-Ad Gottlieb:
Dimension Reduction Techniques for ℓp (1<p<2), with Applications. SoCG 2016: 16:1-16:15 - 2015
- [j6]Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. SIAM J. Discret. Math. 29(3): 1207-1222 (2015) - [i13]Yair Bartal, Lee-Ad Gottlieb:
Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings. CoRR abs/1512.01775 (2015) - 2014
- [c16]Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. SoCG 2014: 60 - [i9]Yair Bartal, Lee-Ad Gottlieb:
Dimension reduction techniques for ℓp, 1 ≤ p < ∞, with applications. CoRR abs/1408.1789 (2014) - 2013
- [c12]Yair Bartal, Lee-Ad Gottlieb:
A Linear Time Approximation Scheme for Euclidean TSP. FOCS 2013: 698-706 - [i6]Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman:
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp, p>2. CoRR abs/1308.4996 (2013) - 2012
- [c10]Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer:
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. STOC 2012: 663-672 - 2011
- [c9]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. SODA 2011: 840-853 - [i4]Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer:
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. CoRR abs/1112.0699 (2011) - 2010
- [i3]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. CoRR abs/1008.1480 (2010)
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-09-18 00:14 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:
