Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

WEA

2007

Springer

2007

Springer

Given a bipartite graph G = (L0, L1, E) and a ﬁxed ordering of the nodes in L0, the problem of ﬁnding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The problem is NP-complete in general and several practically eﬃcient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edges have nonnegative weights. Although this problem is more general and ﬁnds speciﬁc applications in automatic graph layout problems similar to those of the unweighted case, it has not received as much attention. We provide a new technique that eﬃciently approximates a solution to this more general problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.

Related Content

Added |
09 Jun 2010 |

Updated |
09 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
WEA |

Authors |
Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler |

Comments (0)