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.
Gespeichert in:
| Veröffentlicht in: | Trudy Instituta sistemnogo programmirovaniâ 2018-10, Vol.27 (5), p.191-198 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| ISSN: | 2079-8156 2220-6426 |
| DOI: | 10.15514/ISPRAS-2015-27(5)-11 |