SCOPUS 정보 검색 플랫폼

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

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

The buffer minimization problem for multiprocessor scheduling with conflicts

(6) Chrobak, Marek a Csirik, János b Imreh, Csanád b Noga, John c Sgall, Jiří d Woeginger, Gerhard J c

a University of California ^* (United States)

b UNIVERSITY OF SZEGED (Hungary)

c GRAZ UNIVERSITY OF TECHNOLOGY (Austria)

d INSTITUTE OF MATHEMATICS (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

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

BUFFER MINIMIZATION; COMPETITIVE ALGORITHMS; COMPETITIVE RATIO; COMPLETE K-PARTITE GRAPHS; MULTI PROCESSOR SCHEDULING; MULTI PROCESSOR SYSTEMS; POLYNOMIAL-TIME ALGORITHMS; PROCESSING TIME; TASK EXECUTIONS;

TREES (MATHEMATICS);

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
- 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.¹ Lovász, L.² Schrijver, A.³

2
- 0030823075
- Probabilistic analysis for scheduling with conflicts
- S. Irani and V. Leung [1997]. Probabilistic analysis for scheduling with conflicts, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 286-295.
- (1997) Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 286-295
- Irani, S.¹ Leung, V.²

3
- 84936765088
- Scheduling with conflicts, and applications to traffic signal control
- S. Irani and V. Leung [1996]. Scheduling with conflicts, and applications to traffic signal control, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 85-94.
- (1996) Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 85-94
- Irani, S.¹ Leung, V.²

4
- 0000236642
- On chromatic sums and distributed resource allocation
- A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai and T. Tamir [1998]. On chromatic sums and distributed resource allocation. Information and Computation 140, 183-202.
- (1998) Information and Computation , vol.140 , pp. 183-202
- Bar-Noy, A.¹ Bellare, M.² Halldórsson, M.M.³ Shachnai, H.⁴ Tamir, T.⁵

5
- 0000955229
- 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.¹ Kortsarz, G.²

6
- 0028514351
- 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.¹ Yannakakis, M.²

7
- 0028485790
- Non-clairvoyant scheduling
- R. Motwani, S. Philips and E. Torng [1994]. Non-clairvoyant scheduling, Theoretical Computer Science 130, 17-47.
- (1994) Theoretical Computer Science , vol.130 , pp. 17-47
- Motwani, R.¹ Philips, S.² Torng, E.³

8
- 0026434874
- An introduction to chromatic sums
- E. Kubicka and A. J. Schwenk [1989]. An introduction to chromatic sums, Proc. ACM Computer Science Conference, 39-45.
- (1989) Proc. ACM Computer Science Conference , pp. 39-45
- Kubicka, E.¹ Schwenk, A.J.²

9
- 0004215089
- 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.¹

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