메뉴 건너뛰기




Volumn , Issue , 2003, Pages 556-564

Opt versus LOAD in dynamic storage allocation

Author keywords

Approximation algorithms; Dynamic storage allocation; Polynomial time approximation schemes

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

EID: 0038446863     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780624     Document Type: Conference Paper
Times cited : (17)

References (7)
  • 5
    • 0038309441 scopus 로고
    • The linearity of first-fit coloring of interval graphs
    • H. A. Kierstead, "The Linearity of First-Fit Coloring of Interval Graphs," SIAM J. Discrete Math 1 (1988), 526-530.
    • (1988) SIAM J. Discrete Math , vol.1 , pp. 526-530
    • Kierstead, H.A.1
  • 6
    • 0005484181 scopus 로고
    • A polynomial time approximation algorithm for dynamic storage allocation
    • H. A. Kierstead, "A Polynomial Time Approximation Algorithm for Dynamic Storage Allocation," Discrete Mathematics 88 (1991), 231-237.
    • (1991) Discrete Mathematics , vol.88 , pp. 231-237
    • Kierstead, H.A.1
  • 7
    • 0000170712 scopus 로고
    • Problem no. 4
    • London Mathematical Society Lecture Notes Series, Cambridge University Press
    • D. R. Woodall, "Problem No. 4," Proc. British Combinatorial Conference (1973), London Mathematical Society Lecture Notes Series 13, Cambridge University Press, 1974, 202.
    • (1974) Proc. British Combinatorial Conference (1973) , vol.13 , pp. 202
    • Woodall, D.R.1


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