Approximating max-cut under graph-MSO constraints
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10386773" target="_blank" >RIV/00216208:11320/18:10386773 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.orl.2018.10.004" target="_blank" >https://doi.org/10.1016/j.orl.2018.10.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.orl.2018.10.004" target="_blank" >10.1016/j.orl.2018.10.004</a>
Alternative languages
Result language
angličtina
Original language name
Approximating max-cut under graph-MSO constraints
Original language description
We consider the max-cut and max-k-cut problems under graph-based constraints. Our approach can handle any constraint specified using monadic second-order (MSO) logic on graphs of constant treewidth. We give a 0.5-approximation algorithm for this class of problems.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA17-09142S" target="_blank" >GA17-09142S: Modern algorithms: New challenges of complex data sets</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Operations Research Letters
ISSN
0167-6377
e-ISSN
—
Volume of the periodical
46
Issue of the periodical within the volume
6
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
592-598
UT code for WoS article
000454379600008
EID of the result in the Scopus database
2-s2.0-85056471565