Polynomial algorithms with the estimates $frac 34$ and $frac 56$ for the traveling salesman problem of the maximum

A. V. Kostochka, A. I. Serdyukov

Research output: Contribution to journalArticlepeer-review

Original languageEnglish (US)
Pages (from-to)55-59, 84
JournalUpravlyaemye Sistemy
Issue number26
StatePublished - 1985

Cite this