# Lee-Ad Gottlieb

According to our database

Collaborative distances:

^{1}, Lee-Ad Gottlieb authored at least 39 papers between 2003 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Faster Algorithms for Orienteering and k-TSP.

CoRR, 2020

Nested Barycentric Coordinate System as an Explicit Feature Map.

CoRR, 2020

Apportioned Margin Approach for Cost Sensitive Large Margin Classifiers.

CoRR, 2020

Labelings vs. Embeddings: On Distributed Representations of Distances.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Theor. Comput. Sci., 2019

Classification in asymmetric spaces via sample compression.

CoRR, 2019

Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces.

CoRR, 2019

2018

Near-Optimal Sample Compression for Nearest Neighbors.

IEEE Trans. Inf. Theory, 2018

Learning convex polytopes with margin.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Approximate Nearest Neighbor Search for \ell _p -Spaces (2 via Embeddings.

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Efficient Regression in Metric Spaces via Approximate Lipschitz Extension.

IEEE Trans. Inf. Theory, 2017

Nearly optimal classification for semimetrics.

J. Mach. Learn. Res., 2017

2016

Adaptive metric dimensionality reduction.

Theor. Comput. Sci., 2016

Optimizing budget allocation for center and median points.

Theor. Comput. Sci., 2016

The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme.

SIAM J. Comput., 2016

Matrix Sparsification and the Sparse Null Space Problem.

Algorithmica, 2016

Dimension Reduction Techniques for ℓ

_{p}(1
Proceedings of the 32nd International Symposium on Computational Geometry, 2016