Kortsarz G

G Kortsarz

Information about the author G Kortsarz will soon be added to the site.
Found 3 papers in total
Local Search Algorithms for the Red‐Blue Median Problem
Local Search Algorithms for the Red‐Blue Median Problem
2012
In this paper, we consider the following red‐blue median problem which is a...
The Dense k ‐Subgraph Problem
The Dense k ‐Subgraph Problem
2001
This paper considers the problem of computing the dense k ‐vertex subgraph of a...
On the Hardness of Approximating Spanners
On the Hardness of Approximating Spanners
2001
A k ‐spanner of a connected graph G=(V,E) is a subgraph G' consisting of all...
Papers per page: