SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 78, Issue 1-3, 1997, Pages 133-152

Edge disjoint Polyp Packing

(1) Katona, Gyula Y a

a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS (Hungary)

Author keywords

Bin packing problem; First fit algorithm; Packing of paths

Indexed keywords

EID: 30244514585 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(97)00025-5 Document Type: Article

Times cited : (3)

References (4)

1
- 0002293349
- Euler tours and the Chinese postman problem
- J. Edmonds, E. Johnson, Euler tours and the Chinese postman problem, Math. Programming 5 (1973) 88-124.
- (1973) Math. Programming , vol.5 , pp. 88-124
- Edmonds, J.¹ Johnson, E.²

2
- 51249181640
- Bin packing can be solved within 1 + ε in linear time
- W. Fernandez, De La Vega, G.S. Lueker, Bin packing can be solved within 1 + ε in linear time, Combinatorica 1 (1981) 349-355.
- (1981) Combinatorica , vol.1 , pp. 349-355
- Fernandez, W.¹ Lueker, G.S.²

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

4
- 30244530863
- personal communication
- G.O.H. Katona, personal communication, 1991.
- (1991)
- Katona, G.O.H.¹

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