Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Optimal Compaction of Orthogonal Grid Drawings

Klau, G. W., & Mutzel, P. (1999). Optimal Compaction of Orthogonal Grid Drawings. In G. Cornuéjols, R. E. Burkard, & G. J. Woeginger (Eds.), Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99) (pp. 304-319). Berlin: Springer.

Item is

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Klau, Gunnar W.1, Autor           
Mutzel, Petra1, Autor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We consider the two--dimensional compaction problem for orthogonal grid drawings in which the task is to alter the coordinates of the vertices and edge segments while preserving the shape of the drawing so that the total edge length is minimized. The problem is closely related to two--dimensional compaction in VLSI--design and has been shown to be NP--hard. We characterize the set of feasible solutions for the two--dimensional compaction problem in terms of paths in the so--called constraint graphs in $x$-- and $y$--direction. Similar graphs (known as \emph{layout graphs}) have already been used for one--dimensional compaction in VLSI--design, but this is the first time that a direct connection between these graphs is established. Given the pair of constraint graphs, the two--dimensional compaction task can be viewed as extending these graphs by new arcs so that certain conditions are satisfied and the total edge length is minimized. We can recognize those instances having only one such extension; for these cases we solve the compaction problem in polynomial time. We transform the geometrical problem into a graph--theoretical one and formulate it as an integer linear program. Our computational experiments show that the new approach works well in practice.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-021999
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 518027
Anderer: Local-ID: C1256428004B93B8-9FA8605E67ABCFDFC125680A005C782E-KlauMutzel1999a
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Graz, Austria
Start-/Enddatum: 1999

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99)
Genre der Quelle: Konferenzband
 Urheber:
Cornuéjols, Gérard, Herausgeber
Burkard, Rainer E., Herausgeber
Woeginger, Gerhard J., Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Berlin : Springer
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 304 - 319 Identifikator: -

Quelle 2

einblenden:
ausblenden:
Titel: Lecture Notes in Computer Science
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 1610 Artikelnummer: - Start- / Endseite: - Identifikator: ISSN: 0302-9743