Please consider the following problem:
Given: a simple graph (without self-loops and without multiple edges) $G$ on $n$ vertices.
Task: place equidistantly the vertices of $G$ on a circle of unit radius and draw the edges of $G$ in such a way that their total length is minimized.
What is the complexity of this problem?
What is the relevant literature?