MaxCut Above Guarantee
Gespeichert in:
| Titel: | MaxCut Above Guarantee |
|---|---|
| Autoren: | Bliznets, Ivan, Epifanov, Vladislav |
| Weitere Verfasser: | Ivan Bliznets and Vladislav Epifanov, Sub Algorithms and Complexity, Algorithms and Complexity, Leroux, Jerome, Lombardy, Sylvain, Peleg, David |
| Verlagsinformationen: | Dagstuhl Publishing, 2023. |
| Publikationsjahr: | 2023 |
| Schlagwörter: | Tripartite, linear kernel, FPT-algorithm, chordal, ddc:004, 3-colorable, maximum cut |
| Beschreibung: | In this paper, we study the computational complexity of the Maximum Cut problem parameterized above guarantee. Our main result provides a linear kernel for the Maximum Cut problem in connected graphs parameterized above the spanning tree. This kernel significantly improves the previous O(k5) kernel given by Madathil, Saurabh, and Zehavi [ToCS 2020]. We also provide subexponential running time algorithms for this problem in special classes of graphs: chordal, split, and co-bipartite. We complete the picture by lower bounds under the assumption of the ETH. Moreover, we initiate a study of the Maximum Cut problem above 23 |E| lower bound in tripartite graphs. |
| Publikationsart: | Conference object Part of book or chapter of book Article |
| Dateibeschreibung: | application/pdf |
| Sprache: | English |
| DOI: | 10.4230/lipics.mfcs.2023.22 |
| Zugangs-URL: | https://research-portal.uu.nl/en/publications/5f7fad58-705c-496b-a3de-73d0e0b7a7d1 https://doi.org/10.4230/LIPIcs.MFCS.2023.22 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.22 https://dspace.library.uu.nl/handle/1874/431576 |
| Rights: | CC BY |
| Dokumentencode: | edsair.dedup.wf.002..b453e56c83aa58ec6f0c07ddab085cce |
| Datenbank: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstract: | In this paper, we study the computational complexity of the Maximum Cut problem parameterized above guarantee. Our main result provides a linear kernel for the Maximum Cut problem in connected graphs parameterized above the spanning tree. This kernel significantly improves the previous O(k5) kernel given by Madathil, Saurabh, and Zehavi [ToCS 2020]. We also provide subexponential running time algorithms for this problem in special classes of graphs: chordal, split, and co-bipartite. We complete the picture by lower bounds under the assumption of the ETH. Moreover, we initiate a study of the Maximum Cut problem above 23 |E| lower bound in tripartite graphs. |
|---|---|
| DOI: | 10.4230/lipics.mfcs.2023.22 |