Partitioning number sequences into optimal subsequences

Journal of Research and Practice in Information Technology

Volumn 32, Issue 2, 2000, Pages 121-129

  Zobel, J ^a   Dart, P ^b  

^a RMIT UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Algorithms; Analysis of algorithms; Computational complexity

Indexed keywords

EID: 33747584399     PISSN: 1443458X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. GAREY, M.R. and JOHNSON D.S. (1979): Computers and Intractability. San Francisco, Freeman.
2. KASZKIEL, M., ZOBEL, J. and SACKS-DAVIS, R. (1999): Efficient passage ranking for document databases. ACM Transactions on Information Systems, 17(4) October: 406-439.
3. KNUTH, D.E. and PLASS, M.F. (1981): Breaking paragraphs into lines. Software - Practice and Experience, 11:1119-1184.
4. LARMORE, L.L. and HIRSCHBERG, D.S. (1985): Efficient optimal pagination of scrolls. Communications of the ACM, 28(8): 854-856.
5. ZOBEL, J., MOFFAT, A., WILKINSON, R. and SACKS-DAVIS, R. (1995): Efficient retrieval of partial documents. Information Processing & Management, 31(3): 361-377.