English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

Jünger, M., & Mutzel, P. (1997). 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. Journal of Graph Algorithms and Applications, 1(1), 1-25.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Jünger, Michael, Author
Mutzel, Petra1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We present algorithms for the 2-layer straightline crossing minimization problem that are able to compute exact optima. Our computational results lead us to the conclusion that there is no need for heuristics if one layer is fixed, even though the problem is NP-hard, and that for the general problem with two variable layers, true optima can be computed for sparse instances in which the smaller layer contains up to 15 nodes. For bigger instances, the iterated barycenter method turns out to be the method of choice among several popular heuristics whose performance we could assess by comparing their results to optimum solutions.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021997
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 517833
Other: Local-ID: C1256428004B93B8-B04C35CF2D452AD7C125648400518920-Juenger-Mutzel-1-97
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Graph Algorithms and Applications
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 1 (1) Sequence Number: - Start / End Page: 1 - 25 Identifier: -