Practical approximation algorithms for separable packing linear programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 325-337

  Dragan, Feodor F ^a   Kahng, Andrew B ^b   M Ã Ndoiu, Ion I ^c   Muddu, Sudhakar ^d   Zelikovsky, Alexander ^e  

^a KENT STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d Sanera Systems   (United States)

^e GEORGIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; FLOW GRAPHS; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS;

FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; HIGH-END MICROPROCESSORS; MULTI-COMMODITY FLOW; MULTICOMMODITY FLOW PROBLEMS; MULTITERMINAL NETS; PARITY CONSTRAINT; PROBLEM FORMULATION; SOURCE TO SINKS;

APPROXIMATION ALGORITHMS;

EID: 84958042289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_30     Document Type: Conference Paper

References (17)

1. C. Albrecht, “Provably good global routing by a new approximation algorithm for multicommodity flow”, Proc. ISPD, 2000.
2. R.C. Carden and C.-K. Cheng, “Aglobal router using an efficient approximate multicommodity multiterminal flow algorithm”, Proc. DAC, 1991, pp. 316-321.
3. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, and S. Cheung, “Approximation algorithms for directed Steiner problems”, J. Algorithms, 33 (1999), pp. 73-91.
4. J. Cong, L. He, C.-K. Koh and P.H. Madden, “Performance optimization of VLSI interconnect layout”, Integration 21 (1996), pp. 1-94.
5. J. Cong, T. Kong and D.Z. Pan, “Buffer block planning for interconnect-driven floorplanning”, Proc. ICCAD, 1999, pp. 358-363.
6. F.F. Dragan, A.B. Kahng, I.I. Măndoiu, S. Muddu and A. Zelikovsky, “Provably good global buffering using an available buffer block plan”, Proc. ICCAD, 2000, pp. 104-109.
7. L.K. Fleischer, “Approximating fractional multicommodity flow independent of the number of commodities”, Proc. 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 24-31.
8. N. Garg and J. Könemann, “Faster and simpler algorithms for multicommodity flow and other fractional packing problems”, Proc. 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 300-309.
9. J. Huang, X.-L. Hong, C.-K. Cheng and E.S. Kuh, “An efficient timing-driven global routing algorithm”, Proc. DAC, 1993, pp. 596-600.
10. A.B. Kahng and G. Robins. On Optimal Interconnections for VLSI, Kluwer Academic Publishers, Norwell, Massachusetts, 1995.
11. R. Motwani, J. Naor, and P. Raghavan, “Randomized approximation algorithms in combinatorial optimization”, In Approximation algorithms for NP-hard problems (Boston, MA, 1997), D. Hochbaum, Ed., PWS Publishing, pp. 144-191.
12. A.P.-C. Ng, P. Raghavan, and C.D. Thomson, “Experimental results for a linear program global router”. Computers and Artificial Intelligence, 6 (1987), pp. 229-242.
13. C.A. Phillips, “The network inhibition problem”, Proc. 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 776-785.
14. P. Raghavan and C.D. Thomson, “Randomized rounding”, Combinatorica, 7 (1987), pp. 365-374.
15. P. Raghavan and C.D. Thomson, “Multiterminal Global Routing: ADeterministic Approximation Scheme”, Algorithmica, 6 (1991), pp. 73-82.
16. E. Shragowitz and S. Keel, “Aglobal router based on a multicommodity flow model”, Integration, 5 (1987), pp. 3-16.
17. X. Tang and D.F. Wong, “Planning buffer locations by network flows”, Proc. ISPD, 2000