BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Germany
1 × Greece
1 × Italy
8 × USA
Collaborated with:
A.Fiat S.Leonardi I.Abraham O.Neiman L.Gottlieb R.Krauthgamer M.Charikar D.Raz B.Awerbuch Y.Rabani N.Linial M.Mendel A.Naor A.Blum C.Burch A.Tomkins H.J.Karloff R.Vohra Y.Azar E.Feuerstein A.Rosén
Talks about:
metric (7) algorithm (3) competit (3) approxim (3) problem (3) line (3) distribut (2) space (2) optic (2) embed (2)

Person: Yair Bartal

DBLP DBLP: Bartal:Yair

Contributed to:

STOC 20122012
STOC 20072007
STOC 20062006
STOC 20032003
STOC 20012001
STOC 19981998
ICALP 19971997
STOC 19971997
ICALP 19961996
STOC 19961996
STOC 19931993
STOC 19921992

Wrote 13 papers:

STOC-2012-BartalGK #approximate #polynomial #problem
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (YB, LAG, RK), pp. 663–672.
STOC-2007-AbrahamBN #metric
Local embeddings of metric spaces (IA, YB, ON), pp. 631–640.
STOC-2006-AbrahamBN #metric #roadmap
Advances in metric embedding theory (IA, YB, ON), pp. 271–286.
STOC-2003-BartalLMN #metric #on the
On metric ramsey-type phenomena (YB, NL, MM, AN), pp. 463–472.
STOC-2001-BartalCR #approximate #clustering #metric
Approximating min-sum k-clustering in metric spaces (YB, MC, DR), pp. 11–20.
STOC-1998-Bartal #approximate #metric #on the
On Approximating Arbitrary Metrices by Tree Metrics (YB), pp. 161–168.
ICALP-1997-BartalL #network #online
On-Line Routing in All-Optical Networks (YB, SL), pp. 516–526.
STOC-1997-BartalBBT #algorithm
A polylog(n)-Competitive Algorithm for Metrical Task Systems (YB, AB, CB, AT), pp. 711–719.
ICALP-1996-AzarBFFLR #on the
On Capital Investment (YA, YB, EF, AF, SL, AR), pp. 429–441.
STOC-1996-BartalFL #bound #graph #online #problem
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (YB, AF, SL), pp. 531–540.
STOC-1993-AwerbuchBF #distributed
Competitive distributed file allocation (BA, YB, AF), pp. 164–173.
STOC-1992-BartalFKV #algorithm #problem #scheduling
New Algorithms for an Ancient Scheduling Problem (YB, AF, HJK, RV), pp. 51–58.
STOC-1992-BartalFR #algorithm #data transformation #distributed
Competitive Algorithms for Distributed Data Management (YB, AF, YR), pp. 39–50.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.