BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Finland
1 × The Netherlands
1 × United Kingdom
2 × Italy
2 × USA
Collaborated with:
Z.Nutov M.Elkin M.M.Halldórsson A.Bar-Noy R.Gandhi E.Halperin M.Dinitz R.Raz U.Feige H.Shachnai S.Khuller A.Srinivasan J.Chuzhoy S.Guha S.Khanna J.Naor
Talks about:
approxim (8) algorithm (5) problem (3) hard (3) telephon (2) connect (2) improv (2) direct (2) graph (2) cover (2)

Person: Guy Kortsarz

DBLP DBLP: Kortsarz:Guy

Contributed to:

ICALP (1) 20122012
ICALP (1) 20062006
ICALP 20042004
STOC 20042004
ICALP 20032003
STOC 20022002
STOC 20002000
ICALP 19971997

Wrote 10 papers:

ICALP-v1-2012-DinitzKR #approximate #scalability
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner (MD, GK, RR), pp. 290–301.
ICALP-v1-2006-KortsarzN #algorithm #approximate #problem
Tight Approximation Algorithm for Connectivity Augmentation Problems (GK, ZN), pp. 443–452.
ICALP-2004-GandhiHKS #migration #scheduling
Improved Results for Data Migration and Open Shop Scheduling (RG, MMH, GK, HS), pp. 658–669.
STOC-2004-ChuzhoyGHKKN #approximate #symmetry
Asymmetric k-center is log* n-hard to approximate (JC, SG, EH, SK, GK, JN), pp. 21–27.
STOC-2004-KortsarzN #algorithm #approximate #graph
Approximation algorithm for k-node connected subgraphs via critical graphs (GK, ZN), pp. 138–145.
ICALP-2003-ElkinK #algorithm #approximate #multi #problem
Approximation Algorithm for Directed Telephone Multicast Problem (ME, GK), pp. 212–223.
ICALP-2003-GandhiHKKS #algorithm #approximate
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.
STOC-2002-ElkinK #algorithm #approximate #combinator #problem
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem (ME, GK), pp. 438–447.
STOC-2000-FeigeHK #approximate
Approximating the domatic number (UF, MMH, GK), pp. 134–143.
ICALP-1997-Bar-NoyK #graph
The Minimum Color Sum of Bipartite Graphs (ABN, GK), pp. 738–748.

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.