Approximating chromatic sum coloring of bipartite graphs in expected polynomial time

A. S. Asratian; N. N. Kuzyurin

Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS)
Trudy Instituta sistemnogo programmirovaniâ

ISSN 2079-8156 (Print)
ISSN 2220-6426 (Online)

User

eng | рус

Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS)

Advanced search

Archives

Download this PDF file

Fullscreen

For citations:

Asratian A.S., Kuzyurin N.N. Approximating chromatic sum coloring of bipartite graphs in expected polynomial time. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2015;27(5):191-198. (In Russ.) https://doi.org/10.15514/ISPRAS-2015-27(5)-11

This work is licensed under a Creative Commons Attribution 4.0 License.

ISSN 2079-8156 (Print)
ISSN 2220-6426 (Online)

Username
Password
	Remember me
Not a user? Register with this site Forgot your password?

User

Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS)

For citations:

Cookies policy