New theoretical results on quadratic placement

Integration, the VLSI Journal

Volumn 40, Issue 3, 2007, Pages 305-314

  Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Net weights; Quadratic placement; Random walk; Stability; VLSI placement

Indexed keywords

ALGORITHMS; HEURISTIC ALGORITHMS; RANDOM PROCESSES; SIMULATED ANNEALING; VLSI CIRCUITS;

NET WEIGHTS; QUADRATIC PLACEMENT; RANDOM WALK; VLSI PLACEMENT;

QUADRATIC PROGRAMMING;

EID: 33947390440     PISSN: 01679260     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.vlsi.2005.12.012     Document Type: Article

References (37)

1. G. Even, S. Guha, B. Schieber, Improved approximations of crossings in graph drawings and VLSI layout areas, Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, 2000, pp. 296-305.
2. Even G., Naor J., Rao S., and Schieber B. Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47 (2000) 585-616
3. S. Vempala, Random projection: a new approach to VLSI layout, Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998, pp. 389-395.
4. U. Brenner, Plazierung im VLSI-Design, Diploma Thesis, University of Bonn, 2000.
5. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theor. Comput. Sci. 1 (1976) 237-267
6. Rao S., and Richa A.W. New approximation techniques for some linear ordering problems. SIAM J. Comput. 34 (2004) 388-404
7. Wong D.F., Leong H.W., and Liu C.L. Simulated Annealing for VLSI Design (1988), Kluwer, Boston
8. Sechen C. VLSI Placement and Routing Using Simulated Annealing (1988), Kluwer, Boston
9. Lengauer T. Combinatorial Algorithms for Integrated Circuit Layout (1990), Teubner, Wiley, Stuttgart/Chichester
10. O. Faroe, D. Pisinger, M. Zachariasen, Local search for final placement in VLSI design, Proceedings of the IEEE International Conference on Computer-Aided Design, 2001, pp. 565-572.
11. Breuer M.A. Min-cut placement. J. Des. Autom. Fault-Tolerant Computing 1 (1977) 343-382
12. Bui T.N., and Jones C. Finding good approximate vertex and edge partitions is NP-hard. Inform. Process. Lett. 42 (1992) 153-159
13. U. Feige, R. Krauthgamer, A polylogarithmic approximation of the minimum bisection, Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 105-115.
14. C.M. Fiduccia, R.M. Mattheyses, A linear-time heuristic for improving network partitions, Proceedings of the 19th IEEE/ACM Design Automation Conference, 1982, pp. 175-181.
15. Kernighan B.W., and Lin S. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49 (1970) 291-307
16. Alpert C.J., and Kahng A.B. Recent directions in netlist partitioning: a survey. Integration, the VLSI Journal 19 (1995) 1-81
17. Orlin J.B. A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41 (1993) 338-350
18. Vygen J. On dual minimum cost flow algorithms. Math. Methods. Oper. Res. 56 (2002) 101-126
19. Fisk C.J., Caskey D.L., and West L.E. ACCEL: automated circuit card etching layout. Proc. IEEE 55 (1967) 1971-1982
20. Tutte W.T. How to draw a graph. Proc. London Math. Soc. 13 (1963) 743-768
21. Hestenes M.R., and Stiefel E. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49 (1952) 409-439
22. Quinn N.R., and Breuer M.A. A force directed component placement procedure for printed circuit boards. IEEE Trans. Circuits Syst. CAS-26 (1979) 377-388
23. H. Eisenmann, F.M. Johannes, Generic global placement and floorplanning, Proceedings of the 35th IEEE/ACM Design Automation Conference, 1998, pp. 269-274.
24. J. Vygen, Algorithms for large-scale flat placement, Proceedings of the 34th IEEE/ACM Design Automation Conference, 1997, pp. 746-751.
25. Vygen J. Geometric quadrisection in linear time, with application to VLSI placement. Discrete Optim. 2 (2005) 362-390
26. U. Brenner, M. Struzyna, Faster and better global placement by a new transportation algorithm, Proceedings of the 42nd IEEE/ACM Design Automation Conference, 2005, pp. 591-596.
27. Kleinhans J.M., Sigl G., Johannes F.M., and Antreich K.J. GORDIAN: VLSI placement by quadratic programming and slicing optimization. IEEE Trans. Comput. Aided Des. Integrated Circuits Syst. 10 (1991) 356-365
28. C.J. Alpert, T. Chan, D.J.-H. Huang, I. Markov, K. Yan, Quadratic placement revisited, Proceedings of the 34th IEEE/ACM Design Automation Conference, 1997, pp. 752-757.
29. Garey M.R., and Johnson D.S. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32 (1977) 826-834
30. Brenner U., and Vygen J. Worst-case ratios of networks in the rectilinear plane. Networks 38 (2001) 126-139
31. Alpert C.J., Kahng A.B., and Yao S.-Z. Spectral partitioning: the more eigenvectors, the better. Discrete Appl. Math. 90 (1999) 3-26
32. Chaudhuri S., Subrahmanyam K.V., Wagner F., and Zaroliagis C.D. Computing mimicking networks. Algorithmica 26 (2000) 31-49
33. Ihler E., Wagner F., and Wagner D. Modeling hypergraphs by graphs with the same mincut properties. Inform. Process. Lett. 45 (1993) 171-175
34. Doyle P.G., and Snell J.L. Random Walks and Electric Networks (1984), The Mathematical Association of America, Washington DC
35. Cohen E., and Horowitz P. Paradoxical behaviour of mechanical and electrical networks. Nature 352 (1991) 699-701
36. Ajtai M. Recursive construction for 3-regular expanders. Combinatorica 14 (1994) 379-416
37. Coppersmith D., Doyle P., Raghavan P., and Snir M. Random walks on weighted graphs and applications to on-line algorithms. J. ACM 40 (1993) 421-453