Vladimir I. Khandeev, Sergey Neshchadim. Max-Min Problems of Searching for Two Disjoint Subsets. In Nicholas N. Olenev, Yuri G. Evtushenko, Milojica Jacimovic, Michael Yu. Khachay, Vlasta Malkova, editors, Optimization and Applications - 12th International Conference, OPTIMA 2021, Petrovac, Montenegro, September 27 - October 1, 2021, Proceedings. Volume 13078 of Lecture Notes in Computer Science, pages 231-245, Springer, 2021. [doi]
@inproceedings{KhandeevN21, title = {Max-Min Problems of Searching for Two Disjoint Subsets}, author = {Vladimir I. Khandeev and Sergey Neshchadim}, year = {2021}, doi = {10.1007/978-3-030-91059-4_17}, url = {https://doi.org/10.1007/978-3-030-91059-4_17}, researchr = {https://researchr.org/publication/KhandeevN21}, cites = {0}, citedby = {0}, pages = {231-245}, booktitle = {Optimization and Applications - 12th International Conference, OPTIMA 2021, Petrovac, Montenegro, September 27 - October 1, 2021, Proceedings}, editor = {Nicholas N. Olenev and Yuri G. Evtushenko and Milojica Jacimovic and Michael Yu. Khachay and Vlasta Malkova}, volume = {13078}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-030-91059-4}, }