SCOPUS 정보 검색 플랫폼

Volumn 1, Issue , 2002, Pages 427-436

Packet scheduling with fragmentation

a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CABLE TELEVISION SYSTEMS; COMMUNICATION CHANNELS (INFORMATION THEORY); MATHEMATICAL MODELS; OPTIMIZATION; PACKET NETWORKS; REAL TIME SYSTEMS; SCHEDULING; TELECOMMUNICATION TRAFFIC;

APPROXIMATION ALGORITHMS; PACKET SCHEDULING;

TIME DIVISION MULTIPLE ACCESS;

EID: 0036343583 PISSN: 0743166X EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (28)

References (24)

1
- 0002528075
- Approximation algorithms for bin-packing: An updated survey
- In G. Ausiello, M. Lucertini, and P. Serafini, editors; Springer-Verlag, Wien
- (1984) Algorithm Design for Computer System Design , pp. 49-106
- Coffman E.G., Jr.¹ Garey, M.R.² Johnson, D.S.³

2
- 0002026363
- Approximation algorithms for bin packing: A survey
- In D. Hochbaum (ed), PSW publishing, Boston
- (1996) Approximation Algorithms for NP-Hard Problems , pp. 46-93
- Coffman E.G., Jr.¹ Garey, M.R.² Johnson, D.S.³

3
- 0027662340
- Stochastic analysis of a slotted FIFO communication channel
- (1993) IEEE Trans. on Info. Theory , vol.39 , Issue.5 , pp. 1555-1566
- Coffman E.G., Jr.¹ Halfin, S.² Alain, J.-M.³ Philippe, R.⁴

4
- 0010063130
- Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings
- (2000) Siam J. Discrete Math. , vol.13 , pp. 384-402
- Coffman E.G., Jr.¹ Courcoubetis, C.A.² Garey, M.R.³ Johnson, D.S.⁴ Shor, P.W.⁵ Weber, R.R.⁶ Yannakakis, M.⁷

5
- 0018985939
- A stochastic model of bin packing
- (1980) Information and Control , vol.44 , pp. 105-115
- Coffman E.G., Jr.¹ So, K.² Hofri, M.³ Yao, A.C.⁴

6
- 0003947469
- Probabilistic analysis of packing and partitioning algorithms
- Wiley-Interscience Publication, New York
- (1991)
- Coffman E.G., Jr.¹ Lueker, G.S.²

7
- 0004015410
- Data-over-cable service interface specifications - Radio frequency interface specification (status: Interim)
- Multimedia Cable Network System Ltd.; April
- (2000)

8
- 0023953004
- Analysis of a hybrid algorithm for packing unequal bins
- (1988) SIAM J. of Computing , vol.17 , pp. 23-40
- Friesen, D.K.¹ Kuhl, F.S.²

9
- 0010056559
- Analysis of a compound bin packing algorithm
- (1991) SIAM J. Disc. Math. , vol.4 , pp. 61-79
- Friesen, D.K.¹ Langston, M.A.²

10
- 0003603813
- W. H. Freeman and Co., San Francisco
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

11
- 0029710562
- Analysis of the ATDMA/PRMA++ protocol in a mobile satellite system environment
- (1996) Proceedings of the IEEE 46th Vehicular Technology Conference 96', New York, USA , pp. 1225-1229
- Guntsch, A.¹

12
- 0010063131
- A probabilistic analysis of the next-fit bin packing algorithm
- (1984) Journal of Algorithms , vol.5 , pp. 547-556
- Hofri, M.¹

13
- 0000339680
- Worst-case performance bounds for simple one-dimensional packing algorithms
- (1974) SIAM J. of Computing , vol.3 , pp. 299-325
- Johnson, D.S.¹ Demers, A.² Ullman, J.D.³ Garey, M.R.⁴ Graham, R.L.⁵

14
- 0016069667
- Fast algorithms for bin packing
- (1974) Journal of Computer and System Science , vol.8 , pp. 272-314
- Johnson, D.S.¹

15
- 0002349470
- Probabilistic analysis of some bin packing algorithms
- (1982) Proc. 23rd IEEE FOCS , pp. 107-111
- Karmarkar, N.¹

16
- 0020252446
- An efficient approximation scheme for the one-dimensional bin packing problem
- (1982) Proc. 23rd Ann. Symp on Foundations of Computer Science , pp. 312-320
- Karmarkar, N.¹ Karp, R.M.²

17
- 0034266747
- Performance analysis of multiple access protocols for multimedia satellite networks
- (2000) IEEE Journal on Selected Areas in Communications , vol.18 , Issue.9 , pp. 1751-1763
- Koraitim, H.¹ Tohme, S.²

18
- 0010051967
- Performance of heuristics for a computer resource allocation problem
- (1984) SIAM J. Alg. Discrete Methods , vol.5 , pp. 154-161
- Langston, M.A.¹

19
- 0032093343
- Complexity of fragmentable object bin packing and an application
- (1998) Computers and Mathematics with Applications , vol.35 , Issue.11 , pp. 91-97
- Mandal, C.A.¹ Chakrabarti, P.P.² Ghose, S.³

20
- 0004229857
- John Wily and Sons, Ltd., New York
- (1990) Knapsack Problems: Algorithms and Computer Implementations
- Martello, S.¹ Toth, P.²

21
- 84958054012
- Bin packing problems with item fragmentation
- Technical report, Technion EE publication CITT 342, April
- (2001)
- Menakerman, N.¹ Rom, R.²

22
- 0010060191
- Bin packing with item fragmentation. Algorithm and data structures
- Springer
- Proceeding of the 7th International Workshop WADS 2001 , pp. 312-324
- Menakerman, N.¹ Rom, R.²

23
- 0003285868
- Knapsack problems
- In D-Z. Du, P. Pardalos (ed.); Kluwer Academic Publishers
- (1998) Handbook of Combinatorial Optimization , vol.1 , pp. 299-428
- Pisinger, D.¹ Toth, P.²

24
- 0001231127
- Martingale inequalities and NP-complete problems
- (1987) Mathematical Operations Research , vol.12 , pp. 177-181
- Rhee, T.¹ Talagrand, M.²

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