Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
1 answer
267 views

Approximation of Hamiltonian cycles

Let's define the $\texttt{MinHalfSimpCycle}$ search problem: Given $G=(V, E)$ a complete, undirected graph with weights on the edges. We want a simple cycle in $G$ (each vertex appears in it at most ...
Beduin's user avatar
  • 53