Pages that link to "Item:Q2904788"
From MaRDI portal
The following pages link to Simpler approximation of the maximum asymmetric traveling salesman problem (Q2904788):
Displaying 9 items.
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- 35/44-approximation for asymmetric maximum TSP with triangle inequality (Q627544) (← links)
- Maximum ATSP with weights zero and one via half-edges (Q1743116) (← links)
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181) (← links)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
- New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)