New bounds on the barycenter heuristic for bipartite graph drawing

The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad as ( n) times the optimum, where n is the number of nodes in the graph. However, the example used in the proof has many isolated nodes. M

• Type: Journal
• Year: 2002
• Where: IPL
• Authors: Xiao Yu Li, Matthias F. M. Stallmann
• Keywords: Heuristic, IPL 2002, NP-hard Two-layer Edge, Performance Ratio