Approximating chromatic sum coloring of bipartite graphs in expected polynomial time

Approximating chromatic sum coloring of bipartite graphs in expected polynomial time

It is known that if P≠NP the sum coloring problem cannot be approximated within for some constant . We propose for arbitrary small an approximation scheme for this problem that works in expected polynomial time.

Bibliographic Details
Main Authors: A. S. Asratian, N. N. Kuzyurin
Format: Article
Language:English
Published: Ivannikov Institute for System Programming of the Russian Academy of Sciences 2018-10-01
Series:Труды Института системного программирования РАН
Subjects:
проблема хроматической раскраски
двудольные графы
полиномиальное в среднем время
Online Access:https://ispranproceedings.elpub.ru/jour/article/view/682
id doaj-a00eec7d22b74e6baa2a32af52bdcc57
record_format Article
spelling doaj-a00eec7d22b74e6baa2a32af52bdcc572020-11-25T02:15:08Zeng Ivannikov Institute for System Programming of the Russian Academy of SciencesТруды Института системного программирования РАН2079-81562220-64262018-10-0127519119810.15514/ISPRAS-2015-27(5)-11682Approximating chromatic sum coloring of bipartite graphs in expected polynomial timeA. S. Asratian0N. N. Kuzyurin1Linkopings Universitet, Department of MathematicsИСП РАНIt is known that if P≠NP the sum coloring problem cannot be approximated within for some constant . We propose for arbitrary small an approximation scheme for this problem that works in expected polynomial time.https://ispranproceedings.elpub.ru/jour/article/view/682проблема хроматической раскраскидвудольные графыполиномиальное в среднем время
collection DOAJ
language English
format Article
sources DOAJ
author A. S. Asratian
N. N. Kuzyurin
spellingShingle A. S. Asratian
N. N. Kuzyurin
Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
Труды Института системного программирования РАН
проблема хроматической раскраски
двудольные графы
полиномиальное в среднем время
author_facet A. S. Asratian
N. N. Kuzyurin
author_sort A. S. Asratian
title Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
title_short Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
title_full Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
title_fullStr Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
title_full_unstemmed Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
title_sort approximating chromatic sum coloring of bipartite graphs in expected polynomial time
publisher Ivannikov Institute for System Programming of the Russian Academy of Sciences
series Труды Института системного программирования РАН
issn 2079-8156
2220-6426
publishDate 2018-10-01
description It is known that if P≠NP the sum coloring problem cannot be approximated within for some constant . We propose for arbitrary small an approximation scheme for this problem that works in expected polynomial time.
topic проблема хроматической раскраски
двудольные графы
полиномиальное в среднем время
url https://ispranproceedings.elpub.ru/jour/article/view/682
work_keys_str_mv AT asasratian approximatingchromaticsumcoloringofbipartitegraphsinexpectedpolynomialtime
AT nnkuzyurin approximatingchromaticsumcoloringofbipartitegraphsinexpectedpolynomialtime
_version_ 1724897619261521920

Similar Items