Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Klau, Gunnar W.
Mutzel, Petra

dblp
dblp



Editor(s):

Cornuéjols, Gérard
Burkard, Rainer E.
Woeginger, Gerhard J.

dblp
dblp
dblp



BibTeX cite key*:

KlauMutzel1999a

Title, Booktitle

Title*:

Optimal Compaction of Orthogonal Grid Drawings

Booktitle*:

Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99)

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Graz, Austria

Language:

English

Event Date*
(no longer used):

June 9-11, 1999

Organization:


Event Start Date:

11 November 2019

Event End Date:

11 November 2019

Publisher

Name*:

Springer

URL:


Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

1610

Number:


Month:

June

Pages:

304-319

Year*:

1999

VG Wort Pages:


ISBN/ISSN:

0302-9743

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

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.

Keywords:

Integer Programming Graph Drawing, Combinatorial Optimization, Compaction



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography



BibTeX Entry:

@INPROCEEDINGS{KlauMutzel1999a,
AUTHOR = {Klau, Gunnar W. and Mutzel, Petra},
EDITOR = {Cornu{\'e}jols, G{\'e}rard and Burkard, Rainer E. and Woeginger, Gerhard J.},
TITLE = {Optimal Compaction of Orthogonal Grid Drawings},
BOOKTITLE = {Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99)},
PUBLISHER = {Springer},
YEAR = {1999},
VOLUME = {1610},
PAGES = {304--319},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Graz, Austria},
MONTH = {June},
ISBN = {0302-9743},
}


Entry last modified by Anja Becker, 03/02/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Gunnar Klau
Created
10/14/1999 06:50:00 PM
Revisions
3.
2.
1.
0.
Editor(s)
Anja Becker
Anja Becker
Gunnar Klau
Gunnar Klau
Edit Dates
30.03.2000 12:26:33
29.03.2000 14:40:30
23/03/2000 09:33:13
10/14/99 06:50:01 PM