- Algorithmica manuscript No. (will be inserted by the editor)
- APPROXIMATING THE MINIMAL SENSOR SELECTION FOR SUPERVISORY CONTROL
- Twostage Robust Network Design with Exponential Scenarios # Rohit Khandekar + Guy Kortsarz # Vahab Mirrokni Mohammad R. Salavatipour
- An approximation algorithm for the Group Steiner Problem Guy Even Guy Kortsarz y
- Approximating BuyatBulk and Shallowlight kSteiner trees
- Mathematical Programming manuscript No. (will be inserted by the editor)
- The minimum shift design problem: theory and practice Luca Di Gaspero # Johannes Gartner + Guy Kortsarz # Nysret Musliu
- Approximating MinimumPower EdgeCovers and 2, 3Connectivity Guy Kortsarz
- A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem
- On the Hardness of Approximating Spanners Guy Kortsarz
- On approximating the achromatic number \Lambda Guy Kortsarz y Robert Krauthgamer z
- Approximation Algorithm for the Directed Telephone Multicast Problem
- Logarithmic Inapproximability of the Radio Broadcast Problem
- Sum Edge Coloring of Multigraphs via Configuration LP
- Generalized Submodular Cover Problems and Applications
- Integrality ratio for Group Steiner Trees and Directed Steiner Trees Eran Halperin
- A mixed AI-OR heuristic for the minimum shift design problem a Di Gaspero
- Approximating node-connectivity and prize-collecting network-design problems with
- Approximating some network design problems with node Guy Kortsarz
- Improved Approximation Algorithms for Directed Steiner Forest Moran Feldman
- Approximating Buy-at-Bulk and Shallow-light k-Steiner trees MohammadTaghi Hajiaghayi
- Approximating Minimum-Power Degree and Connectivity Problems
- Two-stage Robust Network Design with Exponential Scenarios Rohit Khandekar
- Approximation Algorithms for Network Design Problems with Node Weights
- Hardness of approximation for vertex-connectivity network design problems
- Approximating node connectivity problems via set covers
- Approximating the Weight of Shallow Steiner Guy Kortsarz y
- Generating Sparse 2 spanners Guy Kortsarz David Peleg y
- A note on two source location problems Guy Kortsarz
- Asymmetric k-Center is log n-Hard to Approximate
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 A lower bound for approximating the grundy
- An improved algorithm for radio broadcast Michael Elkin
- An improved approximation of the achromatic number on bipartite Guy Kortsarz
- A Matched Approximation Bound for the Sum of a Greedy Amotz Bar-Noy Magnus M. Halldorssony Guy Kortsarzz
- Minimum Color Sum of Bipartite Graphs Amotz Bar-Noy
- The Dense k-Subgraph Problem Uriel Feige y
- APPROXIMATING MAXIMUM SUBGRAPHS WITHOUT SHORT GUY KORTSARZ, MICHAEL LANGBERG, AND ZEEV NUTOV
- Foundations of Software Technology and Theoretical Computer Science (2009) Submission Approximating Fault-Tolerant
- Approximating the Domatic Number Uriel Feige
- Improved Results for Data Migration and Open Shop Scheduling
- Prize-Collecting Steiner Network Problems MohammadTaghi Hajiaghayi1
- Logarithmic Inapproximability of the Radio Broadcast Problem
- The Checkpoint Problem MohammadTaghi Hajiaghayi
- GENERATING LOW-DEGREE 2-SPANNERS GUY KORTSARZ AND DAVID PELEG
- Sum Multicoloring of Graphs Amotz Bar-Noy Magnus M. Halldorssony Guy Kortsarzz
- The minimum shift design problem Luca Di Gaspero Johannes Gartner Guy Kortsarz Nysret Musliu
- Approximating Minimum-Power Edge-Covers and 2, 3-Connectivity Guy Kortsarz
- The Checkpoint Problem MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, and
- Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
- On a Local Protocol for Concurrent File Transfers MohammadTaghi
- Approximating minimum cost connectivity problems Guy Kortsarz
- Approximating Power Optimization Problems Mohammad T. Hajiaghayi 1 , Guy Kortsarz 2 , Vahab S. Mirrokni 1 , and
- Approximating the Minimal Sensor Selection for Supervisory Control
- How to Allocate Network Centers Judit Bar-Ilan Guy Kortzars y
- On the advantage of overlapping clusters for minimizing conductance
- Combinatorial Algorithms for Capacitated Network Design MohammadTaghi Hajiaghayi
- Corrigendum: Improved Results for Data Migration and Open Shop Scheduling
- Gap between upward and tollbooth instances Guy Kortsarz
- On approximating the achromatic number Guy Kortsarzy Robert Krauthgamerz
- The Capacitated Network Design Problem and the Group Steiner problem: relation and special cases
- On some network design problems with degree constraints Rohit Khandekar
- On a Local Protocol for Concurrent File Transfers MohammadTaghi
- Capacitated Network Design Problems: Hardness, Approximation Algorithms, and
- arXiv:1112.2273v1[cs.DS]10Dec2011 Steiner Forest Orientation Problems
- Label Cover instances with large girth and the hardness of approximating basic k-spanner
