Abstract | ||
---|---|---|
There is a set of rectangular macros with given dimensions, and there are wires connecting some pairs (or sets) of them. We have a placement area where these macros should be placed without overlaps in order to minimize the total length of wires. We present a heuristic algorithm which utilizes a special data structure for representing two dimensional stepfunctions. This results in fast integral computation and function modification over rectangles. Our heuristics, especially our data structure for two-dimensional functions, may be useful in other applications, as well. |
Year | Venue | DocType |
---|---|---|
2015 | arXiv: Data Structures and Algorithms | Journal |
Volume | Citations | PageRank |
abs/1509.01867 | 0 | 0.34 |
References | Authors | |
3 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Endre Csóka | 1 | 44 | 6.42 |
attila deak | 2 | 0 | 0.34 |