Text this: Efficient graph neural networks for travelling salesman problem using multilevel clustering

 __   _    _    _     _  _      ___      ______  
| || | || | || | ||  | \| ||   / _ \\   /_   _// 
| '--' || | || | ||  |  ' ||  | / \ ||  `-| |,-  
| .--. || | \\_/ ||  | .  ||  | \_/ ||    | ||   
|_|| |_||  \____//   |_|\_||   \___//     |_||   
`-`  `-`    `---`    `-` -`    `---`      `-`'