Eric Rivals' group
Home
News
Team
Projects
Publications
Courses
Contact
Approximation algorithm
The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings
The Maximum Asymmetric Travelling Salesman Problem (Max-ATSP), which asks for a Hamiltonian path of maximum weight covering a digraph, and the Maximum Compression(Max-Comp), which, for a finite language $P ≔s1,…,sp$, asks for w, a superstring of P …
Cite
×