Name
Title | ||
|---|---|---|
Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings. |
Year | Venue | Field |
|---|---|---|
2014 | Stringology | Superstring theory,Discrete mathematics,Combinatorics,Substring,Hamiltonian path,Permutation,Directed graph,Greedy algorithm,Ukkonen's algorithm,Travelling salesman problem,Mathematics |
DocType | Citations | PageRank |
Conference | 3 | 0.41 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bastien Cazaux | 1 | 10 | 6.65 |
| E Rivals | 2 | 13 | 6.29 |