Projects per year
Fingerprint
Dive into the research topics where Guy Kortsarz is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Network
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 4 Finished
-
BSF:2014163:APPROXIMABILITY OF NETWORK DESIGN PROBLEMS
National Science Foundation (National Science Foundation (NSF))
9/1/15 → 8/31/19
Project: Research project
-
AF: SMALL: RUI: NETWORK DESIGN AND FACILITY LOCATION PROBLEMS
National Science Foundation (National Science Foundation (NSF))
9/1/12 → 8/31/15
Project: Research project
-
APPROXIMATING NETWORK DESIGN PROBLEMS ON DIRECTED AND UNDIRECTED GRAPHS
National Science Foundation (National Science Foundation (NSF))
2/1/09 → 1/31/12
Project: Research project
-
APPROXIMATING BICRITERIA NETWORK-DESIGN PROBLEMS
National Science Foundation (National Science Foundation (NSF))
2/15/08 → 1/31/09
Project: Research project
Research output
-
On Approximating Degree-Bounded Network Design Problems
Guo, X., Kortsarz, G., Laekhanukit, B., Li, S., Vaz, D. & Xian, J., May 2022, In: Algorithmica. 84, 5, p. 1252-1278 27 p.Research output: Contribution to journal › Article › peer-review
-
The minimum degree Group Steiner problem
Kortsarz, G. & Nutov, Z., Mar 15 2022, In: Discrete Applied Mathematics. 309, p. 229-239 11 p.Research output: Contribution to journal › Article › peer-review
-
Network Design under General Wireless Interference
Halldórsson, M. M., Kortsarz, G., Mitra, P. & Tonoyan, T., Nov 2021, In: Algorithmica. 83, 11, p. 3469-3490 22 p.Research output: Contribution to journal › Article › peer-review
-
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems
Halldórsson, M. M., Kortsarz, G. & Cygan, M., 2021, Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Revised Selected Papers. Kaklamanis, C. & Levin, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 159-173 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12806 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Approximating Spanners and Directed Steiner Forest
Chlamtáč, E., Dinitz, M., Kortsarz, G. & Laekhanukit, B., Jun 2020, In: ACM Transactions on Algorithms. 16, 3, 33.Research output: Contribution to journal › Article › peer-review
1 Scopus citations