Approximating the weight of shallow Steiner treesKORTSARZ, G; PELEG, D.Discrete applied mathematics. 1999, Vol 93, Num 2-3, pp 265-285, issn 0166-218XArticle

Minimum color sum of bipartite graphsBAR-NOY, A; KORTSARZ, G.Journal of algorithms (Print). 1998, Vol 28, Num 2, pp 339-365, issn 0196-6774Article

Generating low-degree 2-spannersKORTSARZ, G; PELEG, D.SIAM journal on computing (Print). 1998, Vol 27, Num 5, pp 1438-1456, issn 0097-5397Article

Approximation algorithms for minimum-time broadcastKORTSARZ, G; PELEG, D.SIAM journal on discrete mathematics (Print). 1995, Vol 8, Num 3, pp 401-427, issn 0895-4801Article

On the hardness of approximating spannersKORTSARZ, G.Algorithmica. 2001, Vol 30, Num 3, pp 432-450, issn 0178-4617Article

A matched approximation bound for the sum of a greedy coloringBAR-NOY, A; HALLDORSSON, M. M; KORTSARZ, G et al.Information processing letters. 1999, Vol 71, Num 3-4, pp 135-140, issn 0020-0190Article

On the hardness of approximating spannersKORTSARZ, G.Lecture notes in computer science. 1998, pp 135-146, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Sum multi-coloring of graphsBAR-NOY, A; HALLDORSSON, M. M; KORTSARZ, G et al.Lecture notes in computer science. 1999, pp 390-401, issn 0302-9743, isbn 3-540-66251-0Conference Paper

How to allocate network centersBAR-ILAN, J; KORTSARZ, G; PELEG, D et al.Journal of algorithms (Print). 1993, Vol 15, Num 3, pp 385-415, issn 0196-6774Article

The dense k-subgraph problemFEIGE, U; KORTSARZ, G; PELEG, D et al.Algorithmica. 2001, Vol 29, Num 3, pp 410-421, issn 0178-4617Article

Local Search Algorithms for the Red-Blue Median ProblemHAJIAGHAYI, M; KHANDEKAR, R; KORTSARZ, G et al.Algorithmica. 2012, Vol 63, Num 4, pp 795-814, issn 0178-4617, 20 p.Conference Paper

Approximating buy-at-bulk and shallow-light k-steiner treesHAJIAGHAYI, M. T; KORTSARZ, G; SALAVATIPOUR, M. R et al.Lecture notes in computer science. 2006, pp 152-163, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper

Information centre allocationBAR-ILAN, J; KORTSARZ, G; PELEG, D et al.Electronic library. 1994, Vol 12, Num 6, pp 361-365, issn 0264-0473Article

APPROXIMATION ALGORITHMS FOR NONUNIFORM BUY-AT-BULK NETWORK DESIGNCHEKURI, C; HAJIAGHAYI, M. T; KORTSARZ, G et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1772-1798, issn 0097-5397, 27 p.Article

Multicoloring planar graphs and partial k-treesHALLDORSSON, M. M; KORTSARZ, G.Lecture notes in computer science. 1999, pp 73-84, issn 0302-9743, isbn 3-540-66329-0Conference Paper

The minimum color sum of bipartite graphsBAR-NOY, A; KORTSARZ, G.Lecture notes in computer science. 1997, pp 738-748, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Multi-coloring treesHALLDORSSON, M. M; KORTSARZ, G; PROSKUROWSKI, A et al.Lecture notes in computer science. 1999, pp 271-280, issn 0302-9743, isbn 3-540-66200-6Conference Paper