@comment FROM: Z_Citations-MS.bib via BibSplit on  Fri Oct 15 13:39:53 EDT 2004 
@inproceedings{  
1999-ISCAS-Stallmann,
author = "M. Stallmann and F. Brglez and D. Ghosh",
title = "{Evaluating Iterative Improvement Heuristics for Bigraph Crossing
                  Minimization}",
booktitle = "IEEE 1999 International Symposium on Circuits and Systems -- ISCAS'99", 
month = "May",
year = "1999",
note   = "{Available at
\verb$http://www.cbl.ncsu.edu/publications/$}",
abstract = {
The {\em bigraph crossing problem}, embedding the two node sets of a
bipartite graph $G = (V_0,V_1,E)$ along two parallel lines so that edge
crossings are minimized, has application to placement optimization for
standard cells and other technologies.
Iterative improvement heuristics involve repeated application of
some transformation on an existing feasible solution to obtain better
feasible solutions.
Typically an increase in the number of iterations, and therefore execution
time, implies an improvement in solution quality.
We investigate tradeoffs between execution time and solution quality in
order to establish the best heuristic for any given time budget.
Our experiments show some clear trends for a scalable class of graphs based 
on actual circuits.
These trends, based on statistically significant samples of each of several 
graph graph sizes, suggest promising directions for development of better
heuristics.
}
}