Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Guy Kortsarz
@article{DBLP:journals/corr/abs-2403-01568,
author = {Ilan Doron Arad and
Guy Kortsarz and
Joseph Naor and
Baruch Schieber and
Hadas Shachnai},
title = {Approximations and Hardness of Packing Partially Ordered Items},
journal = {CoRR},
volume = {abs/2403.01568},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.01568},
doi = {10.48550/ARXIV.2403.01568},
eprinttype = {arXiv},
eprint = {2403.01568},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-01568.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DinitzKKN23,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz and
Zeev Nutov},
editor = {Jaroslaw Byrka and
Andreas Wiese},
title = {Improved Approximations for Relative Survivable Network Design},
booktitle = {Approximation and Online Algorithms - 21st International Workshop,
{WAOA} 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14297},
pages = {190--204},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49815-2\_14},
doi = {10.1007/978-3-031-49815-2\_14},
timestamp = {Thu, 11 Jan 2024 22:28:02 +0100},
biburl = {https://dblp.org/rec/conf/waoa/DinitzKKN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11475,
author = {Michael Dinitz and
Guy Kortsarz and
Shi Li},
title = {Degrees and Network Design: New Problems and Approximations},
journal = {CoRR},
volume = {abs/2302.11475},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.11475},
doi = {10.48550/ARXIV.2302.11475},
eprinttype = {arXiv},
eprint = {2302.11475},
timestamp = {Fri, 24 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-11475.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-06656,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz and
Zeev Nutov},
title = {Improved Approximations for Relative Survivable Network Design},
journal = {CoRR},
volume = {abs/2304.06656},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.06656},
doi = {10.48550/ARXIV.2304.06656},
eprinttype = {arXiv},
eprint = {2304.06656},
timestamp = {Wed, 19 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-06656.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoKLLVX22,
author = {Xiangyu Guo and
Guy Kortsarz and
Bundit Laekhanukit and
Shi Li and
Daniel Vaz and
Jiayi Xian},
title = {On Approximating Degree-Bounded Network Design Problems},
journal = {Algorithmica},
volume = {84},
number = {5},
pages = {1252--1278},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00924-0},
doi = {10.1007/S00453-022-00924-0},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoKLLVX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KortsarzN22,
author = {Guy Kortsarz and
Zeev Nutov},
title = {The minimum degree Group Steiner problem},
journal = {Discret. Appl. Math.},
volume = {309},
pages = {229--239},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.12.003},
doi = {10.1016/J.DAM.2021.12.003},
timestamp = {Thu, 03 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KortsarzN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KortsarzNS22,
author = {Guy Kortsarz and
Zeev Nutov and
Eli Shalom},
title = {Approximating activation edge-cover and facility location problems},
journal = {Theor. Comput. Sci.},
volume = {930},
pages = {218--228},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.07.026},
doi = {10.1016/J.TCS.2022.07.026},
timestamp = {Fri, 09 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KortsarzNS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinitzKK22,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Relative Survivable Network Design},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {41:1--41:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.41},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.41},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DinitzKK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-12245,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz},
title = {Relative Survivable Network Design},
journal = {CoRR},
volume = {abs/2206.12245},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.12245},
doi = {10.48550/ARXIV.2206.12245},
eprinttype = {arXiv},
eprint = {2206.12245},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-12245.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HalldorssonKMT21,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Pradipta Mitra and
Tigran Tonoyan},
title = {Network Design under General Wireless Interference},
journal = {Algorithmica},
volume = {83},
number = {11},
pages = {3469--3490},
year = {2021},
url = {https://doi.org/10.1007/s00453-021-00866-z},
doi = {10.1007/S00453-021-00866-Z},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HalldorssonKMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChalermsookCKLM20,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
title = {From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable
Inapproximability: Clique, Dominating Set, and More},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {4},
pages = {772--810},
year = {2020},
url = {https://doi.org/10.1137/18M1166869},
doi = {10.1137/18M1166869},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChalermsookCKLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChlamtacDKL20,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Guy Kortsarz and
Bundit Laekhanukit},
title = {Approximating Spanners and Directed Steiner Forest: Upper and Lower
Bounds},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {3},
pages = {33:1--33:31},
year = {2020},
url = {https://doi.org/10.1145/3381451},
doi = {10.1145/3381451},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChlamtacDKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HajiaghayiKMPS20,
author = {MohammadTaghi Hajiaghayi and
Guy Kortsarz and
Robert MacDavid and
Manish Purohit and
Kanthi K. Sarpatwar},
title = {Approximation algorithms for connected maximum cut and related problems},
journal = {Theor. Comput. Sci.},
volume = {814},
pages = {74--85},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.01.016},
doi = {10.1016/J.TCS.2020.01.016},
timestamp = {Wed, 18 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HajiaghayiKMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GandhiHKKO20,
author = {Rajiv Gandhi and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Christian Konrad and
Guy Kortsarz and
Hoon Oh},
title = {Radio aggregation scheduling},
journal = {Theor. Comput. Sci.},
volume = {840},
pages = {143--153},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.07.032},
doi = {10.1016/J.TCS.2020.07.032},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GandhiHKKO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GuoKLL0X20,
author = {Xiangyu Guo and
Guy Kortsarz and
Bundit Laekhanukit and
Shi Li and
Daniel Vaz and
Jiayi Xian},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {On Approximating Degree-Bounded Network Design Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {39:1--39:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.39},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.39},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GuoKLL0X20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/KortsarzN20,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {Bounded Degree Group Steiner Tree Problems},
booktitle = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
Bordeaux, France, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12126},
pages = {343--354},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48966-3\_26},
doi = {10.1007/978-3-030-48966-3\_26},
timestamp = {Fri, 29 May 2020 16:43:36 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/KortsarzN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HalldorssonKC20,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Marek Cygan},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {Tight Bounds on Subexponential Time Approximation of Set Cover and
Related Problems},
booktitle = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
pages = {159--173},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_11},
doi = {10.1007/978-3-030-80879-2\_11},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HalldorssonKC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-05374,
author = {Marek Cygan and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
title = {Tight Bounds on Subexponential Time Approximation of Set Cover and
Related Problems},
journal = {CoRR},
volume = {abs/2008.05374},
year = {2020},
url = {https://arxiv.org/abs/2008.05374},
eprinttype = {arXiv},
eprint = {2008.05374},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-05374.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CalinescuKN19,
author = {Gruia C{\u{a}}linescu and
Guy Kortsarz and
Zeev Nutov},
title = {Improved approximation algorithms for minimum power covering problems},
journal = {Theor. Comput. Sci.},
volume = {795},
pages = {285--300},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.07.010},
doi = {10.1016/J.TCS.2019.07.010},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CalinescuKN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/NutovKS19,
author = {Zeev Nutov and
Guy Kortsarz and
Eli Shalom},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Approximating Activation Edge-Cover and Facility Location Problems},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.20},
doi = {10.4230/LIPICS.MFCS.2019.20},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/NutovKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-12848,
author = {Guy Kortsarz and
Zeev Nutov},
title = {Bounded Degree Group Steiner Tree Problems},
journal = {CoRR},
volume = {abs/1910.12848},
year = {2019},
url = {http://arxiv.org/abs/1910.12848},
eprinttype = {arXiv},
eprint = {1910.12848},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-12848.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KortsarzN18,
author = {Guy Kortsarz and
Zeev Nutov},
title = {LP-relaxations for tree augmentation},
journal = {Discret. Appl. Math.},
volume = {239},
pages = {94--105},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.12.033},
doi = {10.1016/J.DAM.2017.12.033},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KortsarzN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EsfandiariK18,
author = {Hossein Esfandiari and
Guy Kortsarz},
title = {A bounded-risk mechanism for the kidney exchange game},
journal = {Discret. Appl. Math.},
volume = {243},
pages = {46--53},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.12.029},
doi = {10.1016/J.DAM.2017.12.029},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EsfandiariK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GandhiHKPS18,
author = {Rajiv Gandhi and
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Manish Purohit and
Kanthi K. Sarpatwar},
title = {On maximum leaf trees and connections to connected maximum cut problems},
journal = {Inf. Process. Lett.},
volume = {129},
pages = {31--34},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.06.002},
doi = {10.1016/J.IPL.2017.06.002},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GandhiHKPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChlamtacDKKR18,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Christian Konrad and
Guy Kortsarz and
George Rabanca},
title = {The Densest k-Subhypergraph Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {2},
pages = {1458--1477},
year = {2018},
url = {https://doi.org/10.1137/16M1096402},
doi = {10.1137/16M1096402},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/ChlamtacDKKR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HalldorssonKMT18,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Pradipta Mitra and
Tigran Tonoyan},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Spanning Trees With Edge Conflicts and Wireless Connectivity},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {158:1--158:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.158},
doi = {10.4230/LIPICS.ICALP.2018.158},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/HalldorssonKMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/CalinescuKN18,
author = {Gruia C{\u{a}}linescu and
Guy Kortsarz and
Zeev Nutov},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Improved Approximation Algorithms for Minimum Power Covering Problems},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {134--148},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_9},
doi = {10.1007/978-3-030-04693-4\_9},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/CalinescuKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/HalldorssonK18,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
editor = {Teofilo F. Gonzalez},
title = {Algorithms for Chromatic Sums, Multicoloring, and Scheduling Dependent
Jobs},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 1: Methologies and Traditional Applications},
pages = {671--684},
publisher = {Chapman and Hall/CRC},
year = {2018},
url = {https://doi.org/10.1201/9781351236423-38},
doi = {10.1201/9781351236423-38},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/HalldorssonK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-04578,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Pradipta Mitra and
Tigran Tonoyan},
title = {Spanning Trees With Edge Conflicts and Wireless Connectivity},
journal = {CoRR},
volume = {abs/1803.04578},
year = {2018},
url = {http://arxiv.org/abs/1803.04578},
eprinttype = {arXiv},
eprint = {1803.04578},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-04578.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-00710,
author = {Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit},
title = {On subexponential running times for approximating directed Steiner
tree and related problems},
journal = {CoRR},
volume = {abs/1811.00710},
year = {2018},
url = {http://arxiv.org/abs/1811.00710},
eprinttype = {arXiv},
eprint = {1811.00710},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-00710.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChitnisEHKKS17,
author = {Rajesh Chitnis and
Hossein Esfandiari and
Mohammad Taghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Saeed Seddighin},
title = {A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals
with Demands},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1216--1239},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0145-8},
doi = {10.1007/S00453-016-0145-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChitnisEHKKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BhangaleGHKK17,
author = {Amey Bhangale and
Rajiv Gandhi and
Mohammad Taghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz},
title = {Bi-Covering: Covering Edges with Two Small Subsets of Vertices},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {4},
pages = {2626--2646},
year = {2017},
url = {https://doi.org/10.1137/16M1082421},
doi = {10.1137/16M1082421},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BhangaleGHKK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DinitzKN17,
author = {Michael Dinitz and
Guy Kortsarz and
Zeev Nutov},
title = {Improved Approximation Algorithm for Steiner \emph{k}-Forest with
Nearly Uniform Weights},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {3},
pages = {40:1--40:16},
year = {2017},
url = {https://doi.org/10.1145/3077581},
doi = {10.1145/3077581},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/DinitzKN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KortsarzN17,
author = {Guy Kortsarz and
Zeev Nutov},
title = {Approximating source location and star survivable network problems},
journal = {Theor. Comput. Sci.},
volume = {674},
pages = {32--42},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.02.008},
doi = {10.1016/J.TCS.2017.02.008},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KortsarzN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChalermsookCKLM17,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
editor = {Chris Umans},
title = {From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and
More},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {743--754},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.74},
doi = {10.1109/FOCS.2017.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChalermsookCKLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChlamtacDKL17,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Guy Kortsarz and
Bundit Laekhanukit},
editor = {Philip N. Klein},
title = {Approximating Spanners and Directed Steiner Forest: Upper and Lower
Bounds},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {534--553},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.34},
doi = {10.1137/1.9781611974782.34},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChlamtacDKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04218,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
title = {From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and
More},
journal = {CoRR},
volume = {abs/1708.04218},
year = {2017},
url = {http://arxiv.org/abs/1708.04218},
eprinttype = {arXiv},
eprint = {1708.04218},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04218.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HajiaghayiKKN16,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
title = {On Fixed Cost k-Flow Problems},
journal = {Theory Comput. Syst.},
volume = {58},
number = {1},
pages = {4--18},
year = {2016},
url = {https://doi.org/10.1007/s00224-014-9572-6},
doi = {10.1007/S00224-014-9572-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HajiaghayiKKN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KortsarzN16,
author = {Guy Kortsarz and
Zeev Nutov},
title = {A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity
of a Graph from 1 to 2},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {2},
pages = {23:1--23:20},
year = {2016},
url = {https://doi.org/10.1145/2786981},
doi = {10.1145/2786981},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KortsarzN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DinitzKR16,
author = {Michael Dinitz and
Guy Kortsarz and
Ran Raz},
title = {Label Cover Instances with Large Girth and the Hardness of Approximating
Basic \emph{k}-Spanner},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {2},
pages = {25:1--25:16},
year = {2016},
url = {https://doi.org/10.1145/2818375},
doi = {10.1145/2818375},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/DinitzKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HajiaghayiKKK16,
author = {Mohammad Taghi Hajiaghayi and
Rohit Khandekar and
Mohammad Reza Khani and
Guy Kortsarz},
title = {Approximation Algorithms for Movement Repairmen},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {4},
pages = {54:1--54:38},
year = {2016},
url = {https://doi.org/10.1145/2908737},
doi = {10.1145/2908737},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HajiaghayiKKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChlamtacDKKR16,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Christian Konrad and
Guy Kortsarz and
George Rabanca},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {The Densest k-Subhypergraph Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {6:1--6:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.6},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.6},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/ChlamtacDKKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KortsarzN16,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {LP-Relaxations for Tree Augmentation},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {13:1--13:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.13},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.13},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KortsarzN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BhangaleGHKK16,
author = {Amey Bhangale and
Rajiv Gandhi and
Mohammad Taghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Bicovering: Covering Edges With Two Small Subsets of Vertices},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {6:1--6:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.6},
doi = {10.4230/LIPICS.ICALP.2016.6},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BhangaleGHKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/EsfandiariK16,
author = {Hossein Esfandiari and
Guy Kortsarz},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {A Bounded-Risk Mechanism for the Kidney Exchange Game},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {416--428},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_31},
doi = {10.1007/978-3-662-49529-2\_31},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/EsfandiariK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Kortsarz16,
author = {Guy Kortsarz},
title = {Fixed-Parameter Approximability and Hardness},
booktitle = {Encyclopedia of Algorithms},
pages = {756--761},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_763},
doi = {10.1007/978-1-4939-2864-4\_763},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Kortsarz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChlamtacDKKR16,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Christian Konrad and
Guy Kortsarz and
George Rabanca},
title = {The Densest k-Subhypergraph Problem},
journal = {CoRR},
volume = {abs/1605.04284},
year = {2016},
url = {http://arxiv.org/abs/1605.04284},
eprinttype = {arXiv},
eprint = {1605.04284},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ChlamtacDKKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChlamtacDKL16,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Guy Kortsarz and
Bundit Laekhanukit},
title = {Approximating Spanners and Directed Steiner Forest: Upper and Lower
Bounds},
journal = {CoRR},
volume = {abs/1607.06068},
year = {2016},
url = {http://arxiv.org/abs/1607.06068},
eprinttype = {arXiv},
eprint = {1607.06068},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChlamtacDKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HajiaghayiBGKK16,
author = {Mohammad Taghi Hajiaghayi and
Amey Bhangale and
Rajiv Gandhi and
Rohit Khandekar and
Guy Kortsarz},
title = {Bicovering: Covering edges with two small subsets of vertices},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-112}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/112},
eprinttype = {ECCC},
eprint = {TR16-112},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HajiaghayiBGKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GandhiK15,
author = {Rajiv Gandhi and
Guy Kortsarz},
title = {On set expansion problems and the small set expansion conjecture},
journal = {Discret. Appl. Math.},
volume = {194},
pages = {93--101},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.05.028},
doi = {10.1016/J.DAM.2015.05.028},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GandhiK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/GandhiHKKO15,
author = {Rajiv Gandhi and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Christian Konrad and
Guy Kortsarz and
Hoon Oh},
editor = {Prosenjit Bose and
Leszek Antoni Gasieniec and
Kay R{\"{o}}mer and
Roger Wattenhofer},
title = {Radio Aggregation Scheduling},
booktitle = {Algorithms for Sensor Systems - 11th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2015,
Patras, Greece, September 17-18, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9536},
pages = {169--182},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28472-9\_13},
doi = {10.1007/978-3-319-28472-9\_13},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/algosensors/GandhiHKKO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HajiaghayiKMPS15,
author = {Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Robert MacDavid and
Manish Purohit and
Kanthi K. Sarpatwar},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Approximation Algorithms for Connected Maximum Cut and Related Problems},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {693--704},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_58},
doi = {10.1007/978-3-662-48350-3\_58},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/HajiaghayiKMPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/EfsandiariK15,
author = {Hossein Efsandiari and
Guy Kortsarz},
editor = {Martin Hoefer},
title = {Brief Announcement: New Mechanisms for Pairwise Kidney Exchange},
booktitle = {Algorithmic Game Theory - 8th International Symposium, {SAGT} 2015,
Saarbr{\"{u}}cken, Germany, September 28-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9347},
pages = {303--304},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48433-3\_25},
doi = {10.1007/978-3-662-48433-3\_25},
timestamp = {Fri, 26 Mar 2021 08:28:34 +0100},
biburl = {https://dblp.org/rec/conf/sagt/EfsandiariK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KortsarzN15,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Ernst W. Mayr},
title = {Approximating Source Location and Star Survivable Network Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {203--218},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_15},
doi = {10.1007/978-3-662-53174-7\_15},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KortsarzN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChitnisEHKKS15,
author = {Rajesh Hemant Chitnis and
Hossein Esfandiari and
MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Saeed Seddighin},
title = {A Tight Algorithm for Strongly Connected Steiner Subgraph On Two Terminals
With Demands},
journal = {CoRR},
volume = {abs/1506.03760},
year = {2015},
url = {http://arxiv.org/abs/1506.03760},
eprinttype = {arXiv},
eprint = {1506.03760},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChitnisEHKKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HajiaghayiKMPS15,
author = {MohammadTaghi Hajiaghayi and
Guy Kortsarz and
Robert MacDavid and
Manish Purohit and
Kanthi K. Sarpatwar},
title = {Approximation Algorithms for Connected Maximum Cut and Related Problems},
journal = {CoRR},
volume = {abs/1507.00648},
year = {2015},
url = {http://arxiv.org/abs/1507.00648},
eprinttype = {arXiv},
eprint = {1507.00648},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HajiaghayiKMPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EsfandiariK15,
author = {Hossein Esfandiari and
Guy Kortsarz},
title = {Low-Risk Mechanisms for the Kidney Exchange Game},
journal = {CoRR},
volume = {abs/1507.02746},
year = {2015},
url = {http://arxiv.org/abs/1507.02746},
eprinttype = {arXiv},
eprint = {1507.02746},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EsfandiariK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KortsarzN15,
author = {Guy Kortsarz and
Zeev Nutov},
title = {A simplified 1.5-approximation algorithm for augmenting edge-connectivity
of a graph from 1 to 2},
journal = {CoRR},
volume = {abs/1507.02799},
year = {2015},
url = {http://arxiv.org/abs/1507.02799},
eprinttype = {arXiv},
eprint = {1507.02799},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KortsarzN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KortsarzN15a,
author = {Guy Kortsarz and
Zeev Nutov},
title = {A 1.75 {LP} approximation for the Tree Augmentation Problem},
journal = {CoRR},
volume = {abs/1507.03009},
year = {2015},
url = {http://arxiv.org/abs/1507.03009},
eprinttype = {arXiv},
eprint = {1507.03009},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KortsarzN15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhandekarKM14,
author = {Rohit Khandekar and
Guy Kortsarz and
Vahab S. Mirrokni},
title = {On the Advantage of Overlapping Clusters for Minimizing Conductance},
journal = {Algorithmica},
volume = {69},
number = {4},
pages = {844--863},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9761-8},
doi = {10.1007/S00453-013-9761-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhandekarKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HajiaghayiKKL14,
author = {Mohammad Taghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Vahid Liaghat},
title = {On a Local Protocol for Concurrent File Transfers},
journal = {Theory Comput. Syst.},
volume = {55},
number = {3},
pages = {613--636},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9500-1},
doi = {10.1007/S00224-013-9500-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HajiaghayiKKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinitzK14,
author = {Michael Dinitz and
Guy Kortsarz},
title = {Matroid Secretary for Regular and Decomposable Matroids},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {5},
pages = {1807--1830},
year = {2014},
url = {https://doi.org/10.1137/13094030X},
doi = {10.1137/13094030X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DinitzK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinitzKN14,
author = {Michael Dinitz and
Guy Kortsarz and
Zeev Nutov},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Improved Approximation Algorithm for Steiner k-Forest with Nearly
Uniform Weights},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {115--127},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.115},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.115},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DinitzKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChitnisEHKKS14,
author = {Rajesh Hemant Chitnis and
Hossein Esfandiari and
MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Saeed Seddighin},
editor = {Marek Cygan and
Pinar Heggernes},
title = {A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals
with Demands (Extended Abstract)},
booktitle = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
pages = {159--171},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_14},
doi = {10.1007/978-3-319-13524-3\_14},
timestamp = {Sat, 19 Oct 2019 20:25:35 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ChitnisEHKKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GandhiK14,
author = {Rajiv Gandhi and
Guy Kortsarz},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {On Set Expansion Problems and the Small Set Expansion Conjecture},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {189--200},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_16},
doi = {10.1007/978-3-319-12340-0\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GandhiK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KhandekarKMS13,
author = {Rohit Khandekar and
Guy Kortsarz and
Vahab S. Mirrokni and
Mohammad R. Salavatipour},
title = {Two-stage Robust Network Design with Exponential Scenarios},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {391--408},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9596-0},
doi = {10.1007/S00453-011-9596-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KhandekarKMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KhandekarKN13,
author = {Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
title = {On some network design problems with degree constraints},
journal = {J. Comput. Syst. Sci.},
volume = {79},
number = {5},
pages = {725--736},
year = {2013},
url = {https://doi.org/10.1016/j.jcss.2013.01.019},
doi = {10.1016/J.JCSS.2013.01.019},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KhandekarKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CyganKN13,
author = {Marek Cygan and
Guy Kortsarz and
Zeev Nutov},
title = {Steiner Forest Orientation Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {3},
pages = {1503--1513},
year = {2013},
url = {https://doi.org/10.1137/120883931},
doi = {10.1137/120883931},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CyganKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GandhiHKS13,
author = {Rajiv Gandhi and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Hadas Shachnai},
title = {Corrigendum: Improved results for data migration and open shop scheduling},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {4},
pages = {34:1--34:7},
year = {2013},
url = {https://doi.org/10.1145/2500123},
doi = {10.1145/2500123},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GandhiHKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HajiaghayiKKK13,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
M. Reza Khani and
Guy Kortsarz},
editor = {Prasad Raghavendra and
Sofya Raskhodnikova and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Approximation Algorithms for Movement Repairmen},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8096},
pages = {218--232},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40328-6\_16},
doi = {10.1007/978-3-642-40328-6\_16},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/HajiaghayiKKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChitnisHK13,
author = {Rajesh Hemant Chitnis and
MohammadTaghi Hajiaghayi and
Guy Kortsarz},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Fixed-Parameter and Approximation Algorithms: {A} New Look},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {110--122},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_11},
doi = {10.1007/978-3-319-03898-8\_11},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ChitnisHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DinitzK13,
author = {Michael Dinitz and
Guy Kortsarz},
editor = {Sanjeev Khanna},
title = {Matroid Secretary for Regular and Decomposable Matroids},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {108--117},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.8},
doi = {10.1137/1.9781611973105.8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DinitzK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HajiaghayiKKN13,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
editor = {Christos Kaklamanis and
Kirk Pruhs},
title = {On Fixed Cost k-Flow Problems},
booktitle = {Approximation and Online Algorithms - 11th International Workshop,
{WAOA} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8447},
pages = {49--60},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-08001-7\_5},
doi = {10.1007/978-3-319-08001-7\_5},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/HajiaghayiKKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HajiaghayiKKK13,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
M. Reza Khani and
Guy Kortsarz},
title = {Approximation Algorithms for Movement Repairmen},
journal = {CoRR},
volume = {abs/1306.3739},
year = {2013},
url = {http://arxiv.org/abs/1306.3739},
eprinttype = {arXiv},
eprint = {1306.3739},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HajiaghayiKKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChitnisHK13,
author = {Rajesh Hemant Chitnis and
MohammadTaghi Hajiaghayi and
Guy Kortsarz},
title = {Fixed-Parameter and Approximation Algorithms: {A} New Look},
journal = {CoRR},
volume = {abs/1308.3520},
year = {2013},
url = {http://arxiv.org/abs/1308.3520},
eprinttype = {arXiv},
eprint = {1308.3520},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChitnisHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HajiaghayiKK13,
author = {Mohammad Taghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz},
title = {The Foundations of Fixed Parameter Inapproximability},
journal = {CoRR},
volume = {abs/1310.2711},
year = {2013},
url = {http://arxiv.org/abs/1310.2711},
eprinttype = {arXiv},
eprint = {1310.2711},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HajiaghayiKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GandhiK13,
author = {Rajiv Gandhi and
Guy Kortsarz},
title = {Edge covering with budget constrains},
journal = {CoRR},
volume = {abs/1311.0713},
year = {2013},
url = {http://arxiv.org/abs/1311.0713},
eprinttype = {arXiv},
eprint = {1311.0713},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GandhiK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HajiaghayiKK12,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz},
title = {Local Search Algorithms for the Red-Blue Median Problem},
journal = {Algorithmica},
volume = {63},
number = {4},
pages = {795--814},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9547-9},
doi = {10.1007/S00453-011-9547-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HajiaghayiKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FeldmanKN12,
author = {Moran Feldman and
Guy Kortsarz and
Zeev Nutov},
title = {Improved approximation algorithms for Directed Steiner Forest},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {1},
pages = {279--292},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.05.009},
doi = {10.1016/J.JCSS.2011.05.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FeldmanKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HajiaghayiKKN12,
author = {Mohammad Taghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
title = {Prize-collecting steiner network problems},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {1},
pages = {2:1--2:13},
year = {2012},
url = {https://doi.org/10.1145/2390176.2390178},
doi = {10.1145/2390176.2390178},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HajiaghayiKKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KhandekarKN12,
author = {Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
title = {Approximating fault-tolerant group-Steiner problems},
journal = {Theor. Comput. Sci.},
volume = {416},
pages = {55--64},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.08.021},
doi = {10.1016/J.TCS.2011.08.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KhandekarKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HajiaghayiKKM12,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Juli{\'{a}}n Mestre},
title = {The checkpoint problem},
journal = {Theor. Comput. Sci.},
volume = {452},
pages = {88--99},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.05.021},
doi = {10.1016/J.TCS.2012.05.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HajiaghayiKKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganKN12,
author = {Marek Cygan and
Guy Kortsarz and
Zeev Nutov},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Steiner Forest Orientation Problems},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {361--372},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_32},
doi = {10.1007/978-3-642-33090-2\_32},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CyganKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DinitzKR12,
author = {Michael Dinitz and
Guy Kortsarz and
Ran Raz},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Label Cover Instances with Large Girth and the Hardness of Approximating
Basic k-Spanner},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {290--301},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_25},
doi = {10.1007/978-3-642-31594-7\_25},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DinitzKR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/KhandekarKM12,
author = {Rohit Khandekar and
Guy Kortsarz and
Vahab S. Mirrokni},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Advantage of Overlapping Clusters for Minimizing Conductance},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {494--505},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_42},
doi = {10.1007/978-3-642-29344-3\_42},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/KhandekarKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-0224,
author = {Michael Dinitz and
Guy Kortsarz and
Ran Raz},
title = {Label Cover instances with large girth and the hardness of approximating
basic k-spanner},
journal = {CoRR},
volume = {abs/1203.0224},
year = {2012},
url = {http://arxiv.org/abs/1203.0224},
eprinttype = {arXiv},
eprint = {1203.0224},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-0224.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-5146,
author = {Michael Dinitz and
Guy Kortsarz},
title = {Matroid Secretary for Regular and Decomposable Matroids},
journal = {CoRR},
volume = {abs/1207.5146},
year = {2012},
url = {http://arxiv.org/abs/1207.5146},
eprinttype = {arXiv},
eprint = {1207.5146},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-5146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KortsarzMNT11,
author = {Guy Kortsarz and
Vahab S. Mirrokni and
Zeev Nutov and
Elena Tsanko},
title = {Approximating Minimum-Power Degree and Connectivity Problems},
journal = {Algorithmica},
volume = {60},
number = {4},
pages = {735--742},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9365-5},
doi = {10.1007/S00453-009-9365-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KortsarzMNT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EvenKN11,
author = {Guy Even and
Guy Kortsarz and
Zeev Nutov},
title = {A 1.5-approximation algorithm for augmenting edge-connectivity of
a graph from 1 to 2},
journal = {Inf. Process. Lett.},
volume = {111},
number = {6},
pages = {296--300},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.12.010},
doi = {10.1016/J.IPL.2010.12.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EvenKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HalldorssonKS11,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Maxim Sviridenko},
title = {Sum edge coloring of multigraphs via configuration {LP}},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {2},
pages = {22:1--22:21},
year = {2011},
url = {https://doi.org/10.1145/1921659.1921668},
doi = {10.1145/1921659.1921668},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HalldorssonKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KortsarzN11,
author = {Guy Kortsarz and
Zeev Nutov},
title = {Approximating some network design problems with node costs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4482--4492},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.013},
doi = {10.1016/J.TCS.2011.04.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KortsarzN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KhandekarKN11,
author = {Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {Network-Design with Degree Constraints},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {289--301},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_25},
doi = {10.1007/978-3-642-22935-0\_25},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KhandekarKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/HajiaghayiKKL11,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Vahid Liaghat},
editor = {Rajmohan Rajaraman and
Friedhelm Meyer auf der Heide},
title = {On a local protocol for concurrent file transfers},
booktitle = {{SPAA} 2011: Proceedings of the 23rd Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-located with {FCRC} 2011)},
pages = {269--278},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1989493.1989538},
doi = {10.1145/1989493.1989538},
timestamp = {Wed, 21 Nov 2018 11:16:22 +0100},
biburl = {https://dblp.org/rec/conf/spaa/HajiaghayiKKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-1176,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
title = {Combinatorial Algorithms for Capacitated Network Design},
journal = {CoRR},
volume = {abs/1108.1176},
year = {2011},
url = {http://arxiv.org/abs/1108.1176},
eprinttype = {arXiv},
eprint = {1108.1176},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-1176.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-2273,
author = {Marek Cygan and
Guy Kortsarz and
Zeev Nutov},
title = {Steiner Forest Orientation Problems},
journal = {CoRR},
volume = {abs/1112.2273},
year = {2011},
url = {http://arxiv.org/abs/1112.2273},
eprinttype = {arXiv},
eprint = {1112.2273},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-2273.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChekuriHKS10,
author = {Chandra Chekuri and
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
title = {Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {5},
pages = {1772--1798},
year = {2010},
url = {https://doi.org/10.1137/090750317},
doi = {10.1137/090750317},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChekuriHKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KortsarzLN10,
author = {Guy Kortsarz and
Michael Langberg and
Zeev Nutov},
title = {Approximating Maximum Subgraphs without Short Cycles},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {1},
pages = {255--269},
year = {2010},
url = {https://doi.org/10.1137/09074944X},
doi = {10.1137/09074944X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KortsarzLN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HajiaghayiKKM10,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Juli{\'{a}}n Mestre},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {The Checkpoint Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {219--231},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_17},
doi = {10.1007/978-3-642-15369-3\_17},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/HajiaghayiKKM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HajiaghayiKK10,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Budgeted Red-Blue Median and Its Generalizations},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {314--325},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_27},
doi = {10.1007/978-3-642-15775-2\_27},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HajiaghayiKK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HajiaghayiKKN10,
author = {MohammadTaghi Hajiaghayi and
Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {Prize-Collecting Steiner Network Problems},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {71--84},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_6},
doi = {10.1007/978-3-642-13036-6\_6},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/HajiaghayiKKN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HajiaghayiKS09,
author = {Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
title = {Approximating Buy-at-Bulk and Shallow-Light \emph{k}-Steiner Trees},
journal = {Algorithmica},
volume = {53},
number = {1},
pages = {89--103},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9013-x},
doi = {10.1007/S00453-007-9013-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HajiaghayiKS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KortsarzN09,
author = {Guy Kortsarz and
Zeev Nutov},
title = {Approximating minimum-power edge-covers and 2, 3-connectivity},
journal = {Discret. Appl. Math.},
volume = {157},
number = {8},
pages = {1840--1847},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.12.001},
doi = {10.1016/J.DAM.2008.12.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KortsarzN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EvenFKN09,
author = {Guy Even and
Jon Feldman and
Guy Kortsarz and
Zeev Nutov},
title = {A 1.8 approximation algorithm for augmenting edge-connectivity of
a graph from 1 to 2},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {2},
pages = {21:1--21:17},
year = {2009},
url = {https://doi.org/10.1145/1497290.1497297},
doi = {10.1145/1497290.1497297},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/EvenFKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KortsarzN09,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Approximating Some Network Design Problems with Node Costs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {231--243},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_18},
doi = {10.1007/978-3-642-03685-9\_18},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KortsarzN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KhandekarKN09,
author = {Rohit Khandekar and
Guy Kortsarz and
Zeev Nutov},
editor = {Ravi Kannan and
K. Narayan Kumar},
title = {Approximating Fault-Tolerant Group-Steiner Problems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
{IIT} Kanpur, India},
series = {LIPIcs},
volume = {4},
pages = {263--274},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2324},
doi = {10.4230/LIPICS.FSTTCS.2009.2324},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/KhandekarKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FeldmanKN09,
author = {Moran Feldman and
Guy Kortsarz and
Zeev Nutov},
editor = {Claire Mathieu},
title = {Improved approximating algorithms for Directed Steiner Forest},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {922--931},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.100},
doi = {10.1137/1.9781611973068.100},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/FeldmanKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/KortsarzN09,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Approximating minimum cost connectivity problems},
booktitle = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09511},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2497/},
timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/KortsarzN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KortsarzN08,
author = {Guy Kortsarz and
Zeev Nutov},
title = {Tight approximation algorithm for connectivity augmentation problems},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {5},
pages = {662--670},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.05.002},
doi = {10.1016/J.JCSS.2007.05.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KortsarzN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KortsarzN08,
author = {Guy Kortsarz and
Zeev Nutov},
title = {A note on two source location problems},
journal = {J. Discrete Algorithms},
volume = {6},
number = {3},
pages = {520--525},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2006.12.010},
doi = {10.1016/J.JDA.2006.12.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KortsarzN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GandhiHKS08,
author = {Rajiv Gandhi and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Hadas Shachnai},
title = {Improved bounds for scheduling conflicting jobs with minsum criteria},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {1},
pages = {11:1--11:20},
year = {2008},
url = {https://doi.org/10.1145/1328911.1328922},
doi = {10.1145/1328911.1328922},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GandhiHKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KortsarzLN08,
author = {Guy Kortsarz and
Michael Langberg and
Zeev Nutov},
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {Approximating Maximum Subgraphs without Short Cycles},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms
and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5171},
pages = {118--131},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3\_10},
doi = {10.1007/978-3-540-85363-3\_10},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KortsarzLN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KhandekarKMS08,
author = {Rohit Khandekar and
Guy Kortsarz and
Vahab S. Mirrokni and
Mohammad R. Salavatipour},
editor = {Dan Halperin and
Kurt Mehlhorn},
title = {Two-Stage Robust Network Design with Exponential Scenarios},
booktitle = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
Germany, September 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5193},
pages = {589--600},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87744-8\_49},
doi = {10.1007/978-3-540-87744-8\_49},
timestamp = {Sun, 02 Jun 2019 21:14:36 +0200},
biburl = {https://dblp.org/rec/conf/esa/KhandekarKMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HalldorssonKS08,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Maxim Sviridenko},
editor = {Andrea Lodi and
Alessandro Panconesi and
Giovanni Rinaldi},
title = {Min Sum Edge Coloring in Multigraphs Via Configuration {LP}},
booktitle = {Integer Programming and Combinatorial Optimization, 13th International
Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5035},
pages = {359--373},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68891-4\_25},
doi = {10.1007/978-3-540-68891-4\_25},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/HalldorssonKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/KortsarzMNT08,
author = {Guy Kortsarz and
Vahab S. Mirrokni and
Zeev Nutov and
Elena Tsanko},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Approximating Minimum-Power Degree and Connectivity Problems},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {423--435},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_37},
doi = {10.1007/978-3-540-78773-0\_37},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/KortsarzMNT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/GasperoGKMSS07,
author = {Luca Di Gaspero and
Johannes G{\"{a}}rtner and
Guy Kortsarz and
Nysret Musliu and
Andrea Schaerf and
Wolfgang Slany},
title = {The minimum shift design problem},
journal = {Ann. Oper. Res.},
volume = {155},
number = {1},
pages = {79--105},
year = {2007},
url = {https://doi.org/10.1007/s10479-007-0221-1},
doi = {10.1007/S10479-007-0221-1},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/GasperoGKMSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HalldorssonKRS07,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Jaikumar Radhakrishnan and
Sivaramakrishnan Sivasubramanian},
title = {Complete partitions of graphs},
journal = {Comb.},
volume = {27},
number = {5},
pages = {519--550},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-2169-9},
doi = {10.1007/S00493-007-2169-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HalldorssonKRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/Kortsarz07,
author = {Guy Kortsarz},
title = {A Lower Bound for Approximating Grundy Numbering},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {9},
number = {1},
year = {2007},
url = {https://doi.org/10.46298/dmtcs.391},
doi = {10.46298/DMTCS.391},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/Kortsarz07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/HajiaghayiKMN07,
author = {Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Vahab S. Mirrokni and
Zeev Nutov},
title = {Power optimization for connectivity problems},
journal = {Math. Program.},
volume = {110},
number = {1},
pages = {195--208},
year = {2007},
url = {https://doi.org/10.1007/s10107-006-0057-5},
doi = {10.1007/S10107-006-0057-5},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/HajiaghayiKMN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HalperinKKSW07,
author = {Eran Halperin and
Guy Kortsarz and
Robert Krauthgamer and
Aravind Srinivasan and
Nan Wang},
title = {Integrality Ratio for Group Steiner Trees and Directed Steiner Trees},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {5},
pages = {1494--1511},
year = {2007},
url = {https://doi.org/10.1137/S0097539704445718},
doi = {10.1137/S0097539704445718},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HalperinKKSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KortsarzS07,
author = {Guy Kortsarz and
Sunil M. Shende},
title = {An Improved Approximation of the Achromatic Number on Bipartite Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {2},
pages = {361--373},
year = {2007},
url = {https://doi.org/10.1137/S0895480104442947},
doi = {10.1137/S0895480104442947},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KortsarzS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ElkinK07,
author = {Michael Elkin and
Guy Kortsarz},
title = {An improved algorithm for radio broadcast},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {1},
pages = {8:1--8:21},
year = {2007},
url = {https://doi.org/10.1145/1219944.1219954},
doi = {10.1145/1219944.1219954},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ElkinK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChekuriHKS07,
author = {Chandra Chekuri and
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Approximation algorithms for node-weighted buy-at-bulk network design},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1265--1274},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283519},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChekuriHKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/KortsarzN07,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Teofilo F. Gonzalez},
title = {Approximating Minimum-Cost Connectivity Problems},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch58},
doi = {10.1201/9781420010749.CH58},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/KortsarzN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FeldmanKN07,
author = {Moran Feldman and
Guy Kortsarz and
Zeev Nutov},
title = {Improved approximation algorithms for directed Steiner forest},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-120}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-120/index.html},
eprinttype = {ECCC},
eprint = {TR07-120},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FeldmanKN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ElkinK06,
author = {Michael Elkin and
Guy Kortsarz},
title = {An Approximation Algorithm for the Directed Telephone Multicast Problem},
journal = {Algorithmica},
volume = {45},
number = {4},
pages = {569--583},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1196-4},
doi = {10.1007/S00453-005-1196-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ElkinK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChekuriEK06,
author = {Chandra Chekuri and
Guy Even and
Guy Kortsarz},
title = {A greedy approximation algorithm for the group Steiner problem},
journal = {Discret. Appl. Math.},
volume = {154},
number = {1},
pages = {15--34},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.07.010},
doi = {10.1016/J.DAM.2005.07.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChekuriEK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/deds/RohloffKK06,
author = {Kurt Rohloff and
Samir Khuller and
Guy Kortsarz},
title = {Approximating the Minimal Sensor Selection for Supervisory Control},
journal = {Discret. Event Dyn. Syst.},
volume = {16},
number = {1},
pages = {143--170},
year = {2006},
url = {https://doi.org/10.1007/s10626-006-6187-3},
doi = {10.1007/S10626-006-6187-3},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/deds/RohloffKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GandhiHKKS06,
author = {Rajiv Gandhi and
Eran Halperin and
Samir Khuller and
Guy Kortsarz and
Aravind Srinivasan},
title = {An improved approximation algorithm for vertex cover with hard capacities},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {1},
pages = {16--33},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.06.004},
doi = {10.1016/J.JCSS.2005.06.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GandhiHKKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ElkinK06,
author = {Michael Elkin and
Guy Kortsarz},
title = {Sublogarithmic approximation for telephone multicast},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {4},
pages = {648--659},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.12.002},
doi = {10.1016/J.JCSS.2005.12.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ElkinK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GandhiHKS06,
author = {Rajiv Gandhi and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Hadas Shachnai},
title = {Improved results for data migration and open shop scheduling},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {1},
pages = {116--129},
year = {2006},
url = {https://doi.org/10.1145/1125994.1126001},
doi = {10.1145/1125994.1126001},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GandhiHKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/HajiaghayiKS06,
author = {Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Approximating Buy-at-Bulk and Shallow-Light \emph{k}-Steiner Trees},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {152--163},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_16},
doi = {10.1007/11830924\_16},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/HajiaghayiKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriHKS06,
author = {Chandra Chekuri and
Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
title = {Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {677--686},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.15},
doi = {10.1109/FOCS.2006.15},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriHKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KortsarzN06,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Tight Approximation Algorithm for Connectivity Augmentation Problems},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {443--452},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_39},
doi = {10.1007/11786986\_39},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KortsarzN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR06-007,
author = {Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
title = {Approximating Buy-at-Bulk k-Steiner trees},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-007}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-007/index.html},
eprinttype = {ECCC},
eprint = {TR06-007},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR06-007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR06-008,
author = {Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Mohammad R. Salavatipour},
title = {Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity
Buy-at-Bulk},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-008}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-008/index.html},
eprinttype = {ECCC},
eprint = {TR06-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR06-008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuzhoyGHKKKN05,
author = {Julia Chuzhoy and
Sudipto Guha and
Eran Halperin and
Sanjeev Khanna and
Guy Kortsarz and
Robert Krauthgamer and
Joseph Naor},
title = {Asymmetric \emph{k}-center is log\({}^{\mbox{*}}\) \emph{n}-hard to
approximate},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {538--551},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082038},
doi = {10.1145/1082036.1082038},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChuzhoyGHKKKN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KortsartsKN05,
author = {Yana Kortsarts and
Guy Kortsarz and
Zeev Nutov},
title = {Greedy approximation algorithms for directed multicuts},
journal = {Networks},
volume = {45},
number = {4},
pages = {214--217},
year = {2005},
url = {https://doi.org/10.1002/net.20066},
doi = {10.1002/NET.20066},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KortsartsKN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KortsarzN05,
author = {Guy Kortsarz and
Zeev Nutov},
title = {Approximating \emph{k}-node Connected Subgraphs via Critical Graphs},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {1},
pages = {247--257},
year = {2005},
url = {https://doi.org/10.1137/S0097539703435753},
doi = {10.1137/S0097539703435753},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KortsarzN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ElkinK05,
author = {Michael Elkin and
Guy Kortsarz},
title = {A Combinatorial Logarithmic Approximation Algorithm for the Directed
Telephone Broadcast Problem},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {3},
pages = {672--689},
year = {2005},
url = {https://doi.org/10.1137/S0097539704440740},
doi = {10.1137/S0097539704440740},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ElkinK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ElkinK05,
author = {Michael Elkin and
Guy Kortsarz},
title = {Polylogarithmic Additive Inapproximability of the Radio Broadcast
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {881--899},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445319},
doi = {10.1137/S0895480104445319},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ElkinK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EvenKS05,
author = {Guy Even and
Guy Kortsarz and
Wolfgang Slany},
title = {On network design problems: fixed cost flows and the covering steiner
problem},
journal = {{ACM} Trans. Algorithms},
volume = {1},
number = {1},
pages = {74--101},
year = {2005},
url = {https://doi.org/10.1145/1077464.1077470},
doi = {10.1145/1077464.1077470},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/EvenKS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HajiaghayiKMN05,
author = {Mohammad Taghi Hajiaghayi and
Guy Kortsarz and
Vahab S. Mirrokni and
Zeev Nutov},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {Power Optimization for Connectivity Problems},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {349--361},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_26},
doi = {10.1007/11496915\_26},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/HajiaghayiKMN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ElkinK05,
author = {Michael Elkin and
Guy Kortsarz},
title = {Improved schedule for radio broadcast},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {222--231},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070464},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ElkinK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KortsarzRS05,
author = {Guy Kortsarz and
Jaikumar Radhakrishnan and
Sivaramakrishnan Sivasubramanian},
title = {Complete partitions of graphs},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {860--869},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070553},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KortsarzRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ElkinK04,
author = {Michael Elkin and
Guy Kortsarz},
title = {Logarithmic inapproximability of the radio broadcast problem},
journal = {J. Algorithms},
volume = {52},
number = {1},
pages = {8--25},
year = {2004},
url = {https://doi.org/10.1016/j.jalgor.2003.11.004},
doi = {10.1016/J.JALGOR.2003.11.004},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ElkinK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KortsarzKL04,
author = {Guy Kortsarz and
Robert Krauthgamer and
James R. Lee},
title = {Hardness of Approximation for Vertex-Connectivity Network Design Problems},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {3},
pages = {704--720},
year = {2004},
url = {https://doi.org/10.1137/S0097539702416736},
doi = {10.1137/S0097539702416736},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KortsarzKL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ElkinK04,
author = {Michael Elkin and
Guy Kortsarz},
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {Polylogarithmic Inapproximability of the Radio Broadcast Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
and Techniques, 7th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
MA, USA, August 22-24, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3122},
pages = {105--116},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27821-4\_10},
doi = {10.1007/978-3-540-27821-4\_10},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ElkinK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GandhiHKS04,
author = {Rajiv Gandhi and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Hadas Shachnai},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Improved Results for Data Migration and Open Shop Scheduling},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {658--669},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_56},
doi = {10.1007/978-3-540-27836-8\_56},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GandhiHKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HalldorssonK04,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Multicoloring: Problems and Techniques},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {25--41},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_2},
doi = {10.1007/978-3-540-28629-5\_2},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HalldorssonK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyGHKKN04,
author = {Julia Chuzhoy and
Sudipto Guha and
Eran Halperin and
Sanjeev Khanna and
Guy Kortsarz and
Joseph Naor},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Asymmetric k-center is log\({}^{\mbox{*}}\) \emph{n}-hard to approximate},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {21--27},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007363},
doi = {10.1145/1007352.1007363},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyGHKKN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KortsarzN04,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Approximation algorithm for k-node connected subgraphs via critical
graphs},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {138--145},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007381},
doi = {10.1145/1007352.1007381},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KortsarzN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KortsartsKN04,
author = {Yana Kortsarts and
Guy Kortsarz and
Zeev Nutov},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Approximation Algorithm for Directed Multicuts},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {61--67},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_7},
doi = {10.1007/978-3-540-31833-0\_7},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/KortsartsKN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/GandhiHKS04,
author = {Rajiv Gandhi and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Hadas Shachnai},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs
with Minsum Criteria},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {68--82},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_8},
doi = {10.1007/978-3-540-31833-0\_8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/GandhiHKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KortsarzN03,
author = {Guy Kortsarz and
Zeev Nutov},
title = {Approximating Node Connectivity Problems via Set Covers},
journal = {Algorithmica},
volume = {37},
number = {2},
pages = {75--92},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1027-4},
doi = {10.1007/S00453-003-1027-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KortsarzN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HalldorssonKS03,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Hadas Shachnai},
title = {Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling
Dependent Jobs},
journal = {Algorithmica},
volume = {37},
number = {3},
pages = {187--209},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1031-8},
doi = {10.1007/S00453-003-1031-8},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HalldorssonKS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HalldorssonKPSST03,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Andrzej Proskurowski and
Ravit Salman and
Hadas Shachnai and
Jan Arne Telle},
title = {Multicoloring trees},
journal = {Inf. Comput.},
volume = {180},
number = {2},
pages = {113--129},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(02)00032-9},
doi = {10.1016/S0890-5401(02)00032-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HalldorssonKPSST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KortsarzS03,
author = {Guy Kortsarz and
Sunil M. Shende},
editor = {Giuseppe Di Battista and
Uri Zwick},
title = {Approximating the Achromatic Number Problem on Bipartite Graphs},
booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
Hungary, September 16-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2832},
pages = {385--396},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39658-1\_36},
doi = {10.1007/978-3-540-39658-1\_36},
timestamp = {Sun, 02 Jun 2019 21:14:37 +0200},
biburl = {https://dblp.org/rec/conf/esa/KortsarzS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GasperoGKMSS03,
author = {Luca Di Gaspero and
Johannes G{\"{a}}rtner and
Guy Kortsarz and
Nysret Musliu and
Andrea Schaerf and
Wolfgang Slany},
editor = {Giuseppe Di Battista and
Uri Zwick},
title = {The Minimum Shift Design Problem: Theory and Practice},
booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
Hungary, September 16-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2832},
pages = {593--604},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39658-1\_54},
doi = {10.1007/978-3-540-39658-1\_54},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GasperoGKMSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GandhiHKKS03,
author = {Rajiv Gandhi and
Eran Halperin and
Samir Khuller and
Guy Kortsarz and
Aravind Srinivasan},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {An Improved Approximation Algorithm for Vertex Cover with Hard Capacities},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {164--175},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_15},
doi = {10.1007/3-540-45061-0\_15},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GandhiHKKS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ElkinK03,
author = {Michael Elkin and
Guy Kortsarz},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {Approximation Algorithm for Directed Telephone Multicast Problem},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {212--223},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_19},
doi = {10.1007/3-540-45061-0\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ElkinK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ElkinK03,
author = {Michael Elkin and
Guy Kortsarz},
title = {Sublogarithmic approximation for telephone multicast: path out of
jungle},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {76--85},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644120},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ElkinK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HalperinKKSW03,
author = {Eran Halperin and
Guy Kortsarz and
Robert Krauthgamer and
Aravind Srinivasan and
Nan Wang},
title = {Integrality ratio for group Steiner trees and directed steiner trees},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {275--284},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644155},
timestamp = {Tue, 07 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/HalperinKKSW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-035,
author = {Eran Halperin and
Guy Kortsarz and
Robert Krauthgamer},
title = {Tight lower bounds for the asymmetric k-center problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-035}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-035/index.html},
eprinttype = {ECCC},
eprint = {TR03-035},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HalldorssonK02,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
title = {Tools for Multicoloring with Applications to Planar Graphs and Partial
k-Trees},
journal = {J. Algorithms},
volume = {42},
number = {2},
pages = {334--366},
year = {2002},
url = {https://doi.org/10.1006/jagm.2001.1210},
doi = {10.1006/JAGM.2001.1210},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/HalldorssonK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeigeHKS02,
author = {Uriel Feige and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Aravind Srinivasan},
title = {Approximating the Domatic Number},
journal = {{SIAM} J. Comput.},
volume = {32},
number = {1},
pages = {172--195},
year = {2002},
url = {https://doi.org/10.1137/S0097539700380754},
doi = {10.1137/S0097539700380754},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FeigeHKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KortsarzKL02,
author = {Guy Kortsarz and
Robert Krauthgamer and
James R. Lee},
editor = {Klaus Jansen and
Stefano Leonardi and
Vijay V. Vazirani},
title = {Hardness of Approximation for Vertex-Connectivity Network-Design Problems},
booktitle = {Approximation Algorithms for Combinatorial Optimization, 5th International
Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2462},
pages = {185--199},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45753-4\_17},
doi = {10.1007/3-540-45753-4\_17},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KortsarzKL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EvenK02,
author = {Guy Even and
Guy Kortsarz},
editor = {David Eppstein},
title = {An approximation algorithm for the group Steiner problem},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {49--58},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545387},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/EvenK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ElkinK02,
author = {Michael Elkin and
Guy Kortsarz},
editor = {John H. Reif},
title = {Combinatorial logarithmic approximation algorithm for directed telephone
broadcast problem},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {438--447},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509972},
doi = {10.1145/509907.509972},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ElkinK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EvenKS02,
author = {Guy Even and
Guy Kortsarz and
Wolfgang Slany},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {On Network Design Problems: Fixed Cost Flows and the Covering Steiner
Problem},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {318--327},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_33},
doi = {10.1007/3-540-45471-3\_33},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/EvenKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigePK01,
author = {Uriel Feige and
Guy Kortsarz and
David Peleg},
title = {The Dense \emph{k}-Subgraph Problem},
journal = {Algorithmica},
volume = {29},
number = {3},
pages = {410--421},
year = {2001},
url = {https://doi.org/10.1007/s004530010050},
doi = {10.1007/S004530010050},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigePK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Kortsarz01,
author = {Guy Kortsarz},
title = {On the Hardness of Approximating Spanners},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {432--450},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0021-y},
doi = {10.1007/S00453-001-0021-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Kortsarz01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KortsarzK01,
author = {Guy Kortsarz and
Robert Krauthgamer},
title = {On Approximating the Achromatic Number},
journal = {{SIAM} J. Discret. Math.},
volume = {14},
number = {3},
pages = {408--422},
year = {2001},
url = {https://doi.org/10.1137/S0895480100379579},
doi = {10.1137/S0895480100379579},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KortsarzK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-IlanKP01,
author = {Judit Bar{-}Ilan and
Guy Kortsarz and
David Peleg},
title = {Generalized submodular cover problems and applications},
journal = {Theor. Comput. Sci.},
volume = {250},
number = {1-2},
pages = {179--200},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(99)00130-9},
doi = {10.1016/S0304-3975(99)00130-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bar-IlanKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/EvenFKN01,
author = {Guy Even and
Jon Feldman and
Guy Kortsarz and
Zeev Nutov},
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {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},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms
and Techniques, 4th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2129},
pages = {90--101},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4\_13},
doi = {10.1007/3-540-44666-4\_13},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/EvenFKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/HalldorssonKS01,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Hadas Shachnai},
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Minimizing Average Completion of Dedicated Tasks and Interval Graphs},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms
and Techniques, 4th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2129},
pages = {114--126},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4\_15},
doi = {10.1007/3-540-44666-4\_15},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/HalldorssonKS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KortsarzK01,
author = {Guy Kortsarz and
Robert Krauthgamer},
editor = {S. Rao Kosaraju},
title = {On approximating the achromatic number},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {309--318},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365466},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/KortsarzK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bar-NoyHKSS00,
author = {Amotz Bar{-}Noy and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Ravit Salman and
Hadas Shachnai},
title = {Sum Multicoloring of Graphs},
journal = {J. Algorithms},
volume = {37},
number = {2},
pages = {422--450},
year = {2000},
url = {https://doi.org/10.1006/jagm.2000.1106},
doi = {10.1006/JAGM.2000.1106},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Bar-NoyHKSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KortsarzN00,
author = {Guy Kortsarz and
Zeev Nutov},
editor = {Klaus Jansen and
Samir Khuller},
title = {Approximating node connectivity problems via set covers},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {194--205},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_20},
doi = {10.1007/3-540-44436-X\_20},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KortsarzN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeigeHK00,
author = {Uriel Feige and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Approximating the domatic number},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {134--143},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335321},
doi = {10.1145/335305.335321},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FeigeHK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HandkeK00,
author = {Dagmar Handke and
Guy Kortsarz},
editor = {Ulrik Brandes and
Dorothea Wagner},
title = {Tree Spanners for Subgraphs and Related Tree Covering Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop,
{WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1928},
pages = {206--217},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40064-8\_20},
doi = {10.1007/3-540-40064-8\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HandkeK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KortsarzP99,
author = {Guy Kortsarz and
David Peleg},
title = {Approximating the Weight of Shallow Steiner Trees},
journal = {Discret. Appl. Math.},
volume = {93},
number = {2-3},
pages = {265--285},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00111-0},
doi = {10.1016/S0166-218X(99)00111-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KortsarzP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bar-NoyHK99,
author = {Amotz Bar{-}Noy and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
title = {A Matched Approximation Bound for the Sum of a Greedy Coloring},
journal = {Inf. Process. Lett.},
volume = {71},
number = {3-4},
pages = {135--140},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(99)00104-0},
doi = {10.1016/S0020-0190(99)00104-0},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Bar-NoyHK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HalldorssonKPSST99,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Andrzej Proskurowski and
Ravit Salman and
Hadas Shachnai and
Jan Arne Telle},
editor = {Takao Asano and
Hiroshi Imai and
D. T. Lee and
Shin{-}Ichi Nakano and
Takeshi Tokuyama},
title = {Multi-coloring Trees},
booktitle = {Computing and Combinatorics, 5th Annual International Conference,
{COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1627},
pages = {271--280},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48686-0\_27},
doi = {10.1007/3-540-48686-0\_27},
timestamp = {Sat, 30 Sep 2023 09:37:25 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HalldorssonKPSST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Bar-NoyHKSS99,
author = {Amotz Bar{-}Noy and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Ravit Salman and
Hadas Shachnai},
editor = {Jaroslav Nesetril},
title = {Sum Multi-coloring of Graphs},
booktitle = {Algorithms - {ESA} '99, 7th Annual European Symposium, Prague, Czech
Republic, July 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1643},
pages = {390--401},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48481-7\_34},
doi = {10.1007/3-540-48481-7\_34},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/Bar-NoyHKSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/HalldorssonK99,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {Multicoloring Planar Graphs and Partial k-Trees},
booktitle = {Randomization, Approximation, and Combinatorial Algorithms and Techniques,
Third International Workshop on Randomization and Approximation Techniques
in Computer Science, and Second International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,
Berkeley, CA, USA, August 8-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {73--84},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_8},
doi = {10.1007/978-3-540-48413-4\_8},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/random/HalldorssonK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bar-NoyK98,
author = {Amotz Bar{-}Noy and
Guy Kortsarz},
title = {Minimum Color Sum of Bipartite Graphs},
journal = {J. Algorithms},
volume = {28},
number = {2},
pages = {339--365},
year = {1998},
url = {https://doi.org/10.1006/jagm.1998.0938},
doi = {10.1006/JAGM.1998.0938},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Bar-NoyK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KortsarzP98,
author = {Guy Kortsarz and
David Peleg},
title = {Generating Low-Degree 2-Spanners},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1438--1456},
year = {1998},
url = {https://doi.org/10.1137/S0097539794268753},
doi = {10.1137/S0097539794268753},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KortsarzP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Kortsarz98,
author = {Guy Kortsarz},
editor = {Klaus Jansen and
Dorit S. Hochbaum},
title = {On the Hardness of Approximation Spanners},
booktitle = {Approximation Algorithms for Combinatorial Optimization, International
Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1444},
pages = {135--146},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0053970},
doi = {10.1007/BFB0053970},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/approx/Kortsarz98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Bar-NoyK97,
author = {Amotz Bar{-}Noy and
Guy Kortsarz},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {The Minimum Color Sum of Bipartite Graphs},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {738--748},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_227},
doi = {10.1007/3-540-63165-8\_227},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Bar-NoyK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KortsarzP97,
author = {Guy Kortsarz and
David Peleg},
editor = {Michael E. Saks},
title = {Approximating Shallow-Light Trees (Extended Abstract)},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {103--110},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314191},
timestamp = {Thu, 05 Jul 2018 07:29:42 +0200},
biburl = {https://dblp.org/rec/conf/soda/KortsarzP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/Bar-IlanKP96,
author = {Judit Bar{-}Ilan and
Guy Kortsarz and
David Peleg},
title = {Generalized Submodular Cover Problems and Applications},
booktitle = {Fourth Israel Symposium on Theory of Computing and Systems, {ISTCS}
1996, Jerusalem, Israel, June 10-12, 1996, Proceedings},
pages = {110--118},
publisher = {{IEEE} Computer Society},
year = {1996},
timestamp = {Tue, 31 May 2016 15:27:26 +0200},
biburl = {https://dblp.org/rec/conf/istcs/Bar-IlanKP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KortsarzP95,
author = {Guy Kortsarz and
David Peleg},
title = {Approximation Algorithms for Minimum-Time Broadcast},
journal = {{SIAM} J. Discret. Math.},
volume = {8},
number = {3},
pages = {401--427},
year = {1995},
url = {https://doi.org/10.1137/S0895480193245923},
doi = {10.1137/S0895480193245923},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KortsarzP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KortsarzP94,
author = {Guy Kortsarz and
David Peleg},
title = {Traffic-light scheduling on the grid},
journal = {Discret. Appl. Math.},
volume = {53},
number = {1-3},
pages = {211--234},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90186-4},
doi = {10.1016/0166-218X(94)90186-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KortsarzP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KortsarzP94,
author = {Guy Kortsarz and
David Peleg},
title = {Generating Sparse 2-Spanners},
journal = {J. Algorithms},
volume = {17},
number = {2},
pages = {222--236},
year = {1994},
url = {https://doi.org/10.1006/jagm.1994.1032},
doi = {10.1006/JAGM.1994.1032},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KortsarzP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KortsarzP94,
author = {Guy Kortsarz and
David Peleg},
editor = {Daniel Dominic Sleator},
title = {Generating Low-Degree 2-Spanners},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {556--563},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314648},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/KortsarzP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bar-IlanKP93,
author = {Judit Bar{-}Ilan and
Guy Kortsarz and
David Peleg},
title = {How to Allocate Network Centers},
journal = {J. Algorithms},
volume = {15},
number = {3},
pages = {385--415},
year = {1993},
url = {https://doi.org/10.1006/jagm.1993.1047},
doi = {10.1006/JAGM.1993.1047},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Bar-IlanKP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KortsarzP93,
author = {Guy Kortsarz and
David Peleg},
title = {On Choosing a Dense Subgraph (Extended Abstract)},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {692--701},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366818},
doi = {10.1109/SFCS.1993.366818},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KortsarzP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/KortsarzP92,
author = {Guy Kortsarz and
David Peleg},
editor = {Danny Dolev and
Zvi Galil and
Michael Rodeh},
title = {Approximation Algorithms for Minimum Time Broadcast},
booktitle = {Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa,
Israel, May 1992},
series = {Lecture Notes in Computer Science},
volume = {601},
pages = {67--78},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0035167},
doi = {10.1007/BFB0035167},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/istcs/KortsarzP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KortsarzP92,
author = {Guy Kortsarz and
David Peleg},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Generating Sparse 2-spanners},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {73--82},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_7},
doi = {10.1007/3-540-55706-7\_7},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/KortsarzP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/KortsarzP92,
author = {Guy Kortsarz and
David Peleg},
editor = {Adrian Segall and
Shmuel Zaks},
title = {Traffic-Light Scheduling on the Grid (Extended Abstract)},
booktitle = {Distributed Algorithms, 6th International Workshop, {WDAG} '92, Haifa,
Israel, November 2-4, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {647},
pages = {238--252},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56188-9\_16},
doi = {10.1007/3-540-56188-9\_16},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/KortsarzP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
