| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Approximating fault-tolerant group-Steiner problems.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
Local Search Algorithms for the Red-Blue Median Problem. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dinitz, Guy Kortsarz, Ran Raz |
Label Cover instances with large girth and the hardness of approximating basic k-spanner |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Moran Feldman, Guy Kortsarz, Zeev Nutov |
Improved approximation algorithms for Directed Steiner Forest. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni |
Advantage of Overlapping Clusters for Minimizing Conductance. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Guy Kortsarz, Zeev Nutov |
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating some network design problems with node costs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
Approximating Minimum-Power Degree and Connectivity Problems. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko |
Sum edge coloring of multigraphs via configuration LP. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Guy Kortsarz, Zeev Nutov |
Steiner Forest Orientation Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Combinatorial Algorithms for Capacitated Network Design |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat |
On a local protocol for concurrent file transfers. |
SPAA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Network-Design with Degree Constraints. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Michael Langberg, Zeev Nutov |
Approximating Maximum Subgraphs without Short Cycles. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
Budgeted Red-Blue Median and Its Generalizations. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Prize-Collecting Steiner Network Problems. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre |
The Checkpoint Problem. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov |
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, graphs, connectivity |
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating minimum-power edge-covers and 2, 3-connectivity. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moran Feldman, Guy Kortsarz, Zeev Nutov |
Improved approximating algorithms for Directed Steiner Forest. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating Some Network Design Problems with Node Costs. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation |
| 1 | Rohit Khandekar, Guy Kortsarz, Zeev Nutov |
Approximating Fault-Tolerant Group-Steiner Problems. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Improved bounds for scheduling conflicting jobs with minsum criteria. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
sum multicoloring, scheduling, Approximation algorithms, linear programming, coloring, LP rounding |
| 1 | Guy Kortsarz, Zeev Nutov |
Tight approximation algorithm for connectivity augmentation problems. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
A note on two source location problems. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour |
Two-Stage Robust Network Design with Exponential Scenarios. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko |
Approximating Minimum-Power Degree and Connectivity Problems. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Maxim Sviridenko |
Min Sum Edge Coloring in Multigraphs Via Configuration LP. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
Edge Scheduling, Configuration LP, Approximation Algorithms |
| 1 | Guy Kortsarz, Michael Langberg, Zeev Nutov |
Approximating Maximum Subgraphs without Short Cycles. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sharon Feldman, Guy Kortsarz, Zeev Nutov |
Improved approximation algorithms for directed Steiner forest. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Guy Kortsarz |
A Lower Bound for Approximating Grundy Numbering. |
Discrete Mathematics & Theoretical Computer Science |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
An improved algorithm for radio broadcast. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Radio broadcast |
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
Complete partitions of graphs. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany |
The minimum shift design problem. |
Annals OR |
2007 |
DBLP DOI BibTeX RDF |
Workforce scheduling, Local search, Hybrid algorithms, Greedy heuristics |
| 1 | Guy Kortsarz, Sunil M. Shende |
An Improved Approximation of the Achromatic Number on Bipartite Graphs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov |
Power optimization for connectivity problems. |
Math. Program. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang |
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximation algorithms for node-weighted buy-at-bulk network design. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximating Buy-at-Bulk k-Steiner trees |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
An Approximation Algorithm for the Directed Telephone Multicast Problem. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Improved results for data migration and open shop scheduling. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
open shop, scheduling, Approximation algorithms, linear programming, data migration, LP rounding |
| 1 | Chandra Chekuri, Guy Even, Guy Kortsarz |
A greedy approximation algorithm for the group Steiner problem. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan |
An improved approximation algorithm for vertex cover with hard capacities. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
Sublogarithmic approximation for telephone multicast. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Rohloff, Samir Khuller, Guy Kortsarz |
Approximating the Minimal Sensor Selection for Supervisory Control. |
Discrete Event Dynamic Systems |
2006 |
DBLP DOI BibTeX RDF |
Computational complexity, Approximation algorithms, Automata, Supervisory control, Sensor selection |
| 1 | Guy Kortsarz, Zeev Nutov |
Tight Approximation Algorithm for Connectivity Augmentation Problems. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
Greedy approximation algorithms for directed multicuts. |
Networks |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Guy Kortsarz, Wolfgang Slany |
On network design problems: fixed cost flows and the covering steiner problem. |
ACM Transactions on Algorithms |
2005 |
DBLP DOI BibTeX RDF |
Optimization, approximation, graphs, theory, flow |
| 1 | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor |
Asymmetric k-center is log* n-hard to approximate. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
asymmetric k-center, metric k-center, Approximation algorithms, hardness of approximation |
| 1 | Michael Elkin, Guy Kortsarz |
Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating k-node Connected Subgraphs via Critical Graphs. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
Improved schedule for radio broadcast. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Jaikumar Radhakrishnan, Sivaramakrishnan Sivasubramanian |
Complete partitions of graphs. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov |
Power Optimization for Connectivity Problems. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
Logarithmic inapproximability of the radio broadcast problem. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Robert Krauthgamer, James R. Lee |
Hardness of Approximation for Vertex-Connectivity Network Design Problems. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Improved Results for Data Migration and Open Shop Scheduling. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz |
Multicoloring: Problems and Techniques. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yana Kortsarts, Guy Kortsarz, Zeev Nutov |
Approximation Algorithm for Directed Multicuts. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
Polylogarithmic Inapproximability of the Radio Broadcast Problem. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor |
Asymmetric k-center is log* n-hard to approximate. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
asymmetric k-center, metric k-center, approximation algorithms, hardness of approximation |
| 1 | Guy Kortsarz, Zeev Nutov |
Approximation algorithm for k-node connected subgraphs via critical graphs. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Halperin, Guy Kortsarz, Robert Krauthgamer |
Tight lower bounds for the asymmetric k-center problem |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Sum Coloring, Scheduling dependent jobs, Approximation algorithms, Multicoloring |
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating Node Connectivity Problems via Set Covers. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Vertex connected spanning subgraph, Metric costs, Approximation algorithms |
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
Multicoloring trees. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany |
The Minimum Shift Design Problem: Theory and Practice. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Sunil M. Shende |
Approximating the Achromatic Number Problem on Bipartite Graphs. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
Sublogarithmic approximation for telephone multicast: path out of jungle. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang |
Integrality ratio for group Steiner trees and directed steiner trees. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
Approximation Algorithm for Directed Telephone Multicast Problem. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan |
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding |
| 1 | Magnús M. Halldórsson, Guy Kortsarz |
Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan |
Approximating the Domatic Number. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Guy Kortsarz |
An approximation algorithm for the group Steiner problem. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Guy Kortsarz, Wolfgang Slany |
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Robert Krauthgamer, James R. Lee |
Hardness of Approximation for Vertex-Connectivity Network-Design Problems. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Guy Kortsarz |
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Judit Bar-Ilan, Guy Kortsarz, David Peleg |
Generalized submodular cover problems and applications. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz |
On the Hardness of Approximating Spanners. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, David Peleg, Guy Kortsarz |
The Dense k-Subgraph Problem. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Robert Krauthgamer |
On Approximating the Achromatic Number. |
SIAM J. Discrete Math. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Robert Krauthgamer |
On approximating the achromatic number. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov |
A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai |
Minimizing Average Completion of Dedicated Tasks and Interval Graphs. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai |
Sum Multicoloring of Graphs. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Dagmar Handke, Guy Kortsarz |
Tree Spanners for Subgraphs and Related Tree Covering Problems. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Approximating node connectivity problems via set covers. |
APPROX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz |
Approximating the domatic number. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz |
A Matched Approximation Bound for the Sum of a Greedy Coloring. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, David Peleg |
Approximating the Weight of Shallow Steiner Trees. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai |
Sum Multi-coloring of Graphs. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
Multi-coloring Trees. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")