Local Search Algorithms for the Red-Blue Median Problem von Hajiaghayi, M., Khandekar, R., Kortsarz, G.

Volltext

On the Hardness of Approximating Spanners von Kortsarz, G.

Volltext

The dense k-subgraph problem von FEIGE, U, KORTSARZ, G, PELEG, D

Volltext

APPROXIMATION ALGORITHMS FOR NONUNIFORM BUY-AT-BULK NETWORK DESIGN von CHEKURI, C, HAJIAGHAYI, M. T, KORTSARZ, G, SALAVATIPOUR, M. R

Volltext

Approximating k-node connected subgraphs via critical graphs von KORTSARZ, Guy, NUTOV, Zeev

Volltext

How to Allocate Network Centers von Barilan, J., Kortsarz, G., Peleg, D.

Volltext

Generating Sparse 2-Spanners von Kortsarz, G., Peleg, D.

Volltext

Approximation algorithms for minimum-time broadcast von KORTSARZ, G, PELEG, D

Volltext

A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem von ELKIN, Michael, KORTSARZ, Guy

Volltext

Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs von HALLDORSSON, Magnus M, KORTSARZ, Guy, SHACHNAI, Hadas

Volltext

Hardness of approximation for vertex-connectivity network design problems von KORTSARZ, Guy, KRAUTHGAMER, Robert, LEE, James R

Volltext

Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees von Hajiaghayi, M. T., Kortsarz, G., Salavatipour, M. R.

Volltext

Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees von Halldórsson, Magnús M., Kortsarz, Guy

Volltext

Logarithmic inapproximability of the radio broadcast problem von Elkin, Michael, Kortsarz, Guy

Volltext

Approximating node connectivity problems via set covers von KORTSARZ, Guy, NUTOV, Zeev

Volltext

A greedy approximation algorithm for the group Steiner problem von Chekuri, Chandra, Even, Guy, Kortsarz, Guy

Volltext

Approximating the domatic number von FEIGE, Uriel, HALLDORSSON, Magnus M, KORTSARZ, Guy, SRINIVASAN, Aravind

Volltext

Generating low-degree 2-spanners von KORTSARZ, G, PELEG, D

Volltext

On the hardness of approximating spanners von Kortsarz, Guy

Volltext

An improved approximation algorithm for vertex cover with hard capacities von Gandhi, Rajiv, Halperin, Eran, Khuller, Samir, Kortsarz, Guy, Srinivasan, Aravind

Volltext