메뉴 건너뛰기




Volumn , Issue , 2006, Pages 480-486

Optimizing yield in global routing

Author keywords

Multi commodity flows; Steiner tree packing; VLSI routing; Yield optimization

Indexed keywords

BOOLEAN FUNCTIONS; DESIGN; OPTIMIZATION; ROUTING ALGORITHMS;

EID: 46149107550     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2006.320161     Document Type: Conference Paper
Times cited : (41)

References (13)
  • 2
    • 85176695123 scopus 로고    scopus 로고
    • R. C. Carden IV, J. Li and C.-K. Cheng, A global router with a theoretical bound on the optimum solution, in IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 15, pp. 208-216, 1996.
    • R. C. Carden IV, J. Li and C.-K. Cheng, "A global router with a theoretical bound on the optimum solution", in IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, vol. 15, pp. 208-216, 1996.
  • 3
    • 84981632113 scopus 로고
    • The Steiner problem in graphs
    • S. E. Dreyfus and R. A. Wagner, "The Steiner problem in graphs", in Networks, vol. 1, pp. 195-207, 1972.
    • (1972) Networks , vol.1 , pp. 195-207
    • Dreyfus, S.E.1    Wagner, R.A.2
  • 6
    • 0035513318 scopus 로고    scopus 로고
    • A survey on multi-net global routing for integrated circuits
    • J. Hu and S. S. Sapatnekar, "A survey on multi-net global routing for integrated circuits", in Integration, the VLSI Journal, vol. 31, pp. 1-49, 2001.
    • (2001) Integration, the VLSI Journal , vol.31 , pp. 1-49
    • Hu, J.1    Sapatnekar, S.S.2
  • 8
    • 27644592104 scopus 로고
    • Modeling of lithography related yield losses for CAD of VLSI circuits
    • July
    • W. Maly, "Modeling of lithography related yield losses for CAD of VLSI circuits", IEEE Transactions on Computer-Aided Design, vol. CAD-4, pp. 166-177, July 1985.
    • (1985) IEEE Transactions on Computer-Aided Design , vol.CAD-4 , pp. 166-177
    • Maly, W.1
  • 9
    • 46149087222 scopus 로고    scopus 로고
    • P. Raghavan, Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems, Ph.D. thesis, Report No. UCB/CSD 87/312, University of California, Berkeley, 1986.
    • P. Raghavan, "Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems", Ph.D. thesis, Report No. UCB/CSD 87/312, University of California, Berkeley, 1986.
  • 10
    • 51249173817 scopus 로고
    • Randomized rounding: A technique for provably good algorithms and algorithmic proofs
    • P. Raghavan and C. D. Thompson, "Randomized rounding: a technique for provably good algorithms and algorithmic proofs", in Combinatorica, vol. 7, pp. 365-374, 1987.
    • (1987) Combinatorica , vol.7 , pp. 365-374
    • Raghavan, P.1    Thompson, C.D.2
  • 11
    • 0025415365 scopus 로고
    • The maximum concurrent flow problem
    • F. Shahrokhi and D. W. Matula, "The maximum concurrent flow problem", in Journal of the ACM, vol. 37, pp. 318-334, 1990.
    • (1990) Journal of the ACM , vol.37 , pp. 318-334
    • Shahrokhi, F.1    Matula, D.W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.