A linear arrangement problem with applications
A linear arrangement problem, called the minmax mincut problem, emerging from circuit design is investigated. Its input is a series-parallel directed hypergraph, and the output is a linear arrangement (and a layout). The primary objective is to minimize the longest path, and the secondary objective...
Saved in:
Published in | 1995 IEEE International Symposium on Circuits and Systems Vol. 1; pp. 57 - 60 vol.1 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
1995
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!