A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We consider the problem of finding a planar embedding of a graph at fixed vertex locations that minimizes the total edge length. The problem is known to be NP-hard. We give polynomial time algorithms achieving an O( √ n log n) approximation for paths and matchings, and an O(n) approximation for general graphs.doi:10.1007/978-3-319-03841-4_33 fatcat:gj6aw4zwybf2hjgix2jcctgohu