Geometric quadrisection in linear time, with application to VLSI placement

Discrete Optimization

Volumn 2, Issue 4, 2005, Pages 362-390

  Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Generalized Assignment Problem; Multiple Knapsack Problem; Quadrisection; VLSI placement; Weighted median

Indexed keywords

ALGORITHMS; MICROPROCESSOR CHIPS; PROBLEM SOLVING; RELAXATION PROCESSES; THEOREM PROVING;

GENERALIZED ASSIGNMENT PROBLEM; MULTIPLE KNAPSACK PROBLEM; QUADRISECTION; VLSI PLACEMENT; WEIGHTED MEDIAN;

VLSI CIRCUITS;

EID: 27744556040     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.08.007     Document Type: Article

References (25)

1. R.K. Ahuja, J.B. Orlin, C. Stein, and R.E. Tarjan Improved algorithms for bipartite network flow SIAM J. Comput. 23 1994 906 933
2. C.J. Alpert, and A.B. Kahng Recent directions in netlist partitioning a survey Integration, the VLSI J. 19 1995 1 81
3. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan Time bounds for selection J. Comput. System Sci. 7 1973 448 461
4. E. Boros, and F.K. Hwang Optimality of nested partitions and its application to cluster analysis SIAM J. Optim. 6 1996 1153 1162
5. U. Brenner, Plazierung im VLSI-Design, Diploma Thesis, University of Bonn, 2000.
6. U. Brenner, A. Rohe, An effective congestion driven placement framework, Proceedings of the ACM International Symposium on Physical Design, 2002, pp. 6-11.
7. C. Chekuri, and S. Khanna A PTAS for the multiple knapsack problem Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms 2000 213 222
8. G.B. Dantzig Discrete-variable extremum problems Oper. Res. 5 1957 266 277
9. G. Even, J. Naor, S. Rao, and B. Schieber Divide-and-conquer approximation algorithms via spreading metrics J. ACM 47 2000 585 616
10. K. Jansen, and L. Porkolab Improved approximation schemes for scheduling unrelated parallel machines Math. Oper. Res. 26 2001 324 338
11. R.M. Karp Reducibility among combinatorial problems R.E. Miller J.W. Thatcher Complexity of Computer Computations 1972 Plenum Press New York 85 103
12. J. Koehl, U. Baur, T. Ludwig, B. Kick, and T. Pflueger A flat, timing-driven design system for a high-performance CMOS processor chipset Proceedings of the Conference on Design, Automation, and Test in Europe 1998 IEEE Press New York 312 320
13. J. Koehl, D.E. Lackey, and G.W. Doerre IBM's 50 million gate ASICs Proceedings of the Asia and South Pacific Design Automation Conference (ASP-DAC) 2003 IEEE Press New York 628 634
14. B. Korte, J. Vygen, Combinatorial Optimization: Theory and Algorithms, Springer, Berlin, 2000 (third ed. 2006).
15. T. Lengauer Combinatorial Algorithms for Integrated Circuit Layout 1990 Teubner, Wiley Chichester
16. J.K. Lenstra, D.B. Shmoys, and É. Tardos Approximation algorithms for scheduling unrelated parallel machines Math. Programming 46 1990 259 271
17. J.B. Orlin A faster strongly polynomial minimum cost flow algorithm Oper. Res. 41 1993 338 350
18. D.B. Shmoys, and É. Tardos An approximation algorithm for the generalized assignment problem Math. Programming 62 1993 461 474
19. T. Tokuyama, and J. Nakano Faster algorithms for the Hitchcock transportation problem SIAM J. Comput. 24 1995 563 578
20. A.N. Tolstoǐ, Metody nakhozhdeniya naimen'shego summovogo kilometrazha pri planirovanii perevozok v prostanstve, in: Planirovanie Perevozok, Sbornik pervyǐ, Transpechat' NKPS, Moskow 1930, pp. 23-55
21. see A. Schrijver, On the history of the transportation and maximum flow problems, Math. Programming, 91 (2002) 437-445.
22. R.-S. Tsay, E.S. Kuh, and C.-P. Hsu Proud a sea-of-gates placement algorithm IEEE Design and Test of Comput. 5 1988 44 56
23. J. Vygen Algorithms for large-scale flat placement Proceedings of the 34th Design Automation Conference 1997 ACM New York 746 751
24. J. Vygen On dual minimum cost flow algorithms Math. Methods Oper. Res. 56 2002 101 126
25. J. Vygen, Theory of VLSI Layout, Habilitationsschrift, University of Bonn, 2001.