메뉴 건너뛰기




Volumn 2076 LNCS, Issue , 2001, Pages 862-874

The buffer minimization problem for multiprocessor scheduling with conflicts

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATA THEORY; MULTIPROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; SCHEDULING; ALGORITHMS; COMPUTATIONAL LINGUISTICS;

EID: 84857732838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_70     Document Type: Conference Paper
Times cited : (31)

References (9)
  • 1
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • M. Grötschel, L. Lovász, and A. Schrijver [1981]. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197.
    • (1981) Combinatorica , vol.1 , pp. 169-197
    • Grötschel, M.1    Lovász, L.2    Schrijver, A.3
  • 5
    • 0000955229 scopus 로고    scopus 로고
    • Minimum color sum of bipartite graphs
    • A. Bar-Noy and G. Kortsarz [1998]. Minimum color sum of bipartite graphs, Journal of Algorithms 28, 339-365.
    • (1998) Journal of Algorithms , vol.28 , pp. 339-365
    • Bar-Noy, A.1    Kortsarz, G.2
  • 6
    • 0028514351 scopus 로고
    • On the hardness of approximating minimization problems
    • C. Lund and M. Yannakakis [1994]. On the hardness of approximating minimization problems. Journal of the ACM 41, 960-981.
    • (1994) Journal of the ACM , vol.41 , pp. 960-981
    • Lund, C.1    Yannakakis, M.2
  • 9
    • 0004215089 scopus 로고    scopus 로고
    • Morgan Kauffman Publishers, San Francisco, California 1996
    • N. A. Lynch [1996]. Distributed Algorithms. Morgan Kauffman Publishers, San Francisco, California, 1996.
    • (1996) Distributed Algorithms
    • Lynch, N.A.1


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