Go to the corresponding LIPIcs Volume Portal 
Schieber, Baruch ; Vahidi, Soroush
pdfformat: 

@InProceedings{schieber_et_al:LIPIcs.ESA.2023.93, author = {Schieber, Baruch and Vahidi, Soroush}, title = {{Approximating Connected Maximum Cuts via Local Search}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {93:193:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772952}, ISSN = {18688969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and FarachColton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18746}, URN = {urn:nbn:de:0030drops187466}, doi = {10.4230/LIPIcs.ESA.2023.93}, annote = {Keywords: approximation algorithms, graph theory, maxcut, local search} }
Keywords:  approximation algorithms, graph theory, maxcut, local search  
Collection:  31st Annual European Symposium on Algorithms (ESA 2023)  
Issue Date:  2023  
Date of publication:  30.08.2023 