Pages that link to "Item:Q475199"
From MaRDI portal
The following pages link to A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199):
Displayed 4 items.
- Complexity of the traveling tournament problem (Q620946) (← links)
- Complexity of the unconstrained traveling tournament problem (Q1755839) (← links)
- A further improvement on approximating TTP-2 (Q2695281) (← links)
- Unconstrained traveling tournament problem is APX-complete (Q6047703) (← links)