If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2023

    An $O(\sqrt{k})$-Approximation Algorithm for Minimum Power k Edge Disjoint st-Paths.

    Nutov, Z., 2023, CiE. Della Vedova, G., Dundua, B., Lempp, S. & Manea, F. (eds.). Springer Science and Business Media Deutschland GmbH, p. 287-296 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13967 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Improved Approximations for Relative Survivable Network Design

    Dinitz, M., Koranteng, A., Kortsarz, G. & Nutov, Z., 2023, Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Proceedings. Byrka, J. & Wiese, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 190-204 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14297 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2022

    Data Structures for Node Connectivity Queries

    Nutov, Z., 1 Sep 2022, ESA. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 82:1-82:12 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 244).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2021

    2-Node-Connectivity Network Design

    Nutov, Z., 2021, Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Revised Selected Papers. Kaklamanis, C. & Levin, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 220-235 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12806 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Approximation Algorithms for Connectivity Augmentation Problems

    Nutov, Z., 2021, Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings. Santhanam, R. & Musatov, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 321-338 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12730 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs

    Nutov, Z., 2021, Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings. Santhanam, R. & Musatov, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 339-348 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12730 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2020

    A 4 + ε approximation for k-connected subgraphs

    Nutov, Z., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 1000-1009 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Approximating k-connected m-dominating sets

    Nutov, Z., 1 Aug 2020, 28th Annual European Symposium on Algorithms, ESA 2020. Grandoni, F., Herman, G. & Sanders, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 73. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 173).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Bounded Degree Group Steiner Tree Problems

    Kortsarz, G. & Nutov, Z., 2020, Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Proceedings. Gasieniec, L., Gasieniec, L., Klasing, R. & Radzik, T. (eds.). Springer, p. 343-354 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12126 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Covering Users by a Connected Swarm Efficiently

    Danilchenko, K., Segal, M. & Nutov, Z., 2020, Algorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers. Pinotti, C. M., Navarra, A. & Bagchi, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 32-44 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12503 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2019

    Approximating activation edge-cover and facility location problems

    Nutov, Z., Kortsarz, G. & Shalom, E., Aug 2019, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019. Katoen, J-P., Heggernes, P. & Rossmanith, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 20:1 - 20:14 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 138).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2018

    Improved approximation algorithms for minimum power covering problems

    Calinescu, G., Kortsarz, G. & Nutov, Z., 2018, Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Revised Selected Papers. Epstein, L. & Erlebach, T. (eds.). Springer Verlag, p. 134-148 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11312 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2017

    On the tree augmentation problem

    Nutov, Z., 1 Sep 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2016

    Approximating source location and star survivable network problems

    Kortsarz, G. & Nutov, Z., 2016, Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Revised Papers. Mayr, E. W. (ed.). Springer Verlag, p. 203-218 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9224 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Improved approximation algorithms for min-cost connectivity augmentation problems

    Nutov, Z., 2016, Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings. Woeginger, G. J. & Kulikov, A. S. (eds.). Springer Verlag, p. 324-339 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9691).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • LP-relaxations for tree augmentation

    Kortsarz, G. & Nutov, Z., 1 Sep 2016, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. Jansen, K., Mathieu, C., Rolim, J. D. P. & Umans, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 60).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2015

    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 (Extended abstract)

    Even, G., Feldman, J., Kortsarz, G. & Nutov, Z., 2015, 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, Proceedings. Trevisan, L., Jansen, K., Goemans, M. & Rolim, J. D. P. (eds.). Springer Verlag, p. 90-101 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2129).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Approximating Steiner trees and forests with minimum number of Steiner points

    Cohen, N. & Nutov, Z., 2015, Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers. Svensson, O. & Bampis, E. (eds.). Springer Verlag, p. 95-106 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8952).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2014

    Improved approximation algorithm for steiner κ-Forest with nearly uniform weights

    Dinitz, M., Kortsarz, G. & Nutov, Z., 1 Sep 2014, Leibniz International Proceedings in Informatics, LIPIcs. Jansen, K., Rolim, J. D. P., Devanur, N. R. & Moore, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 115-127 13 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 28).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • On fixed cost k-flow problems

    Hajiaghayi, M., Khandekar, R., Kortsarz, G. & Nutov, Z., 2014, Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Revised Selected Papers. Springer Verlag, p. 49-60 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8447 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2012

    Approximating minimum power edge-multi-covers

    Cohen, N. & Nutov, Z., 2012, Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Proceedings. p. 64-75 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7353 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Approximating subset k-connectivity problems

    Nutov, Z., 2012, Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Revised Selected Papers. p. 9-20 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7164 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Degree-constrained node-connectivity

    Nutov, Z., 2012, LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Proceedings. p. 582-593 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7256 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Scheduling of vehicles in transportation networks

    Kowalski, D., Nutov, Z. & Segal, M., 2012, Communication Technologies for Vehicles - 4th International Workshop, Nets4Cars/Nets4Trains 2012, Proceedings. p. 124-136 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7266 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Steiner forest orientation problems

    Cygan, M., Kortsarz, G. & Nutov, Z., 2012, Algorithms, ESA 2012 - 20th Annual European Symposium, Proceedings. p. 361-372 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7501 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Survivable network activation problems

    Nutov, Z., 2012, LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Proceedings. p. 594-605 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7256 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2011

    A (1 + ln 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

    Cohen, N. & Nutov, Z., 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 147-157 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Approximating survivable networks with minimum number of Steiner points

    Kamma, L. & Nutov, Z., 2011, Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Revised Papers. p. 154-165 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6534 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Network-design with degree constraints

    Khandekar, R., Kortsarz, G. & Nutov, Z., 2011, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 289-301 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6845 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2010

    Prize-collecting Steiner network problems

    Hajiaghayi, M. T., Khandekar, R., Kortsarz, G. & Nutov, Z., 2010, Integer Programming and Combinatorial Optimization - 14th International Conference, IPCO 2010, Proceedings. Springer Verlag, p. 71-84 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6080 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2009

    An almost O(log k)-approximation for k-connected subgraphs

    Nutov, Z., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery, p. 912-921 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Approximating Fault-Tolerant Group-Steiner problems

    Khandekar, R., Kortsarz, G. & Nutov, Z., 2009, Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009 - 29th Annual Conference, Proceedings. p. 263-274 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 4).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Approximating minimum cost connectivity problems via uncrossable bifamilies and spider-cover decompositions

    Nutov, Z., 2009, Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009. p. 417-426 10 p. 5438613. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Approximating node-connectivity augmentation problems

    Nutov, Z., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 286-297 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Approximating some network design problems with node costs

    Kortsarz, G. & Nutov, Z., 2009, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, Proceedings. p. 231-243 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5687 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improved approximating algorithms for Directed Steiner Forest

    Feldman, M., Kortsarz, G. & Nutov, Z., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 922-931 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improved approximation algorithms for maximum lifetime problems in wireless networks

    Nutov, Z. & Segal, M., 2009, Algorithmic Aspects of Wireless Sensor Networks - 5th International Workshop, ALGOSENSORS 2009, Revised Selected Papers. p. 41-51 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5804 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2008

    Approximating directed weighted-degree constrained networks

    Nutov, Z., 2008, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. p. 219-232 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5171 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows

    Nutov, Z., 2008, DIALM-POMC'08: Proceedings of the ACM 5th International Workshop on Foundations of Mobile Computing. p. 29-33 5 p. (DIALM-POMC'08: Proceedings of the ACM 5th International Workshop on Foundations of Mobile Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Approximating maximum subgraphs without short cycles

    Kortsarz, G., Langberg, M. & Nutov, Z., 2008, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. p. 118-131 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5171 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Approximating minimum-power degree and connectivity problems

    Kortsarz, G., Mirrokni, V. S., Nutov, Z. & Tsanko, E., 2008, LATIN 2008: Theoretical Informatics - 8th Latin American Symposium, Proceedings. Springer Verlag, p. 423-435 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4957 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Approximating minimum-power k-connectivity

    Nutov, Z., 2008, Ad-hoc, Mobile and Wireless Networks - 7th International Conference, ADHOC-NOW 2008, Proceedings. p. 86-93 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5198 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Approximating steiner networks with node weights

    Nutov, Z., 2008, LATIN 2008: Theoretical Informatics - 8th Latin American Symposium, Proceedings. p. 411-422 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4957 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Inapproximability of survivable networks

    Lando, Y. & Nutov, Z., 2008, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. Springer Verlag, p. 146-152 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5171 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Novel algorithms for the network lifetime problem in wireless settings

    Elkin, M., Lando, Y., Nutov, Z., Segal, M. & Shpungin, H., 2008, Ad-hoc, Mobile and Wireless Networks - 7th International Conference, ADHOC-NOW 2008, Proceedings. p. 425-438 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5198 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2007

    Approximating interval scheduling problems with bounded profits

    Beniaminy, I., Nutov, Z. & Ovadia, M., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 487-497 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • On minimum power connectivity problems

    Lando, Y. & Nutov, Z., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 87-98 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2006

    Approximating minimum power covers of intersecting families and directed connectivity problems

    Nutov, Z., 2006, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a. Springer Verlag, p. 236-247 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4110 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • Tight approximation algorithm for connectivity augmentation problems

    Kortsarz, G. & Nutov, Z., 2006, Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Springer Verlag, p. 443-452 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4051 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2000

    Approximating node connectivity problems via set covers

    Kortsarz, G. & Nutov, Z., 2000, Approximation Algorithms for Combinatorial Optimization - 3rd International Workshop, APPROX 2000, Proceedings. Jansen, K. & Khuller, S. (eds.). Springer Verlag, p. 194-205 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1913).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access