Guy Kortsarz
Guy Kortsarz
Professor computer science
Email verificata su camden.rutgers.edu - Home page
TitoloCitata daAnno
The Dense k -Subgraph Problem
U Feige, D Peleg, G Kortsarz
Algorithmica 29 (3), 410-421, 2001
5632001
Approximating thedomatic number
U Feige, MM Halldórsson, G Kortsarz, A Srinivasan
SIAM Journal on computing 32 (1), 172-195, 2002
2322002
How to allocate network centers
J Barilan, G Kortsarz, D Peleg
Journal of Algorithms 15 (3), 385-415, 1993
1841993
On choosing a dense subgraph
G Kortsarz, D Peleg
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 692-701, 1993
1701993
Approximating minimum-cost connectivity problems
G Kortsarz, Z Nutov
Handbook of Approximation Algorithms and Metaheuristics, 58-1-58-22, 2007
1382007
Generating sparse 2-spanners
G Kortsarz, D Peleg
Journal of Algorithms 17 (2), 222-236, 1994
1181994
On the hardness of approximating spanners
G Kortsarz
Algorithmica 30 (3), 432-450, 2001
1082001
Hardness of approximation for vertex-connectivity network design problems
G Kortsarz, R Krauthgamer, JR Lee
SIAM Journal on Computing 33 (3), 704-720, 2004
1022004
Approximating node connectivity problems via set covers
G Kortsarz, Z Nutov
Algorithmica 37 (2), 75-92, 2003
902003
Generalized submodular cover problems and applications
J Bar-Ilan, G Kortsarz, D Peleg
Theoretical Computer Science 250 (1-2), 179-200, 2001
892001
Approximating the weight of shallow Steiner trees
G Kortsarz, D Peleg
Discrete Applied Mathematics 93 (2-3), 265-285, 1999
881999
Approximation algorithms for nonuniform buy-at-bulk network design
C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour
SIAM Journal on Computing 39 (5), 1772-1798, 2010
862010
Minimum color sum of bipartite graphs
A Bar-Noy, G Kortsarz
Journal of Algorithms 28 (2), 339-365, 1998
851998
Approximation algorithms for minimum-time broadcast
G Kortsarz, D Peleg
SIAM Journal on Discrete Mathematics 8 (3), 401-427, 1995
771995
A greedy approximation algorithm for the group Steiner problem
C Chekuri, G Even, G Kortsarz
Discrete Applied Mathematics 154 (1), 15-34, 2006
742006
Improved approximation algorithms for directed steiner forest
M Feldman, G Kortsarz, Z Nutov
Journal of Computer and System Sciences 78 (1), 279-292, 2012
732012
A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem
M Elkin, G Kortsarz
SIAM journal on Computing 35 (3), 672-689, 2005
732005
On network design problems: fixed cost flows and the covering steiner problem
G Even, G Kortsarz, W Slany
ACM Transactions on Algorithms (TALG) 1 (1), 74-101, 2005
712005
Asymmetric k-center is log* n-hard to approximate
J Chuzhoy, S Guha, E Halperin, S Khanna, G Kortsarz, R Krauthgamer, ...
Journal of the ACM (JACM) 52 (4), 538-551, 2005
702005
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs
MM Halldórsson, G Kortsarz, H Shachnai
Algorithmica 37 (3), 187-209, 2003
602003
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20