Bit allocation in sub-linear time and the multiple-choice knapsack problem

Data Compression Conference Proceedings

Volumn 2002-January, Issue , 2002, Pages 352-361

  Mohr, A E ^a  

^a University of Washington   (United States)

Author keywords

Approximation algorithms; Bit rate; Character generation; Computer science; Data compression; Equations; Operations research; Partitioning algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BUDGET CONTROL; COMBINATORIAL OPTIMIZATION; COMPUTER SCIENCE; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

BIT RATES; BUDGET CONSTRAINT; CHARACTER GENERATION; DECISION PROBLEMS; EQUATIONS; MULTIPLE CHOICE KNAPSACK PROBLEM; OPTIMAL BIT ALLOCATION; PARTITIONING ALGORITHMS;

DATA COMPRESSION;

EID: 0141748795     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2002.999973     Document Type: Conference Paper

References (15)

1. A. V. Trushkin, "Optimal bit allocation algorithm for quantizing a random vector," Probl. Inf. Transmission, vol. 17, pp. 156-161, July-Sept. 1981. Translated from Russian.
2. Y. Shoham and A. Gersho, "Efficient bit allocation for an arbitrary set of quantizers," IEEE Transactions on Acoustics Speech and Signal Processing, vol. 36, pp. 1445-1453, Sept. 1988.
3. E. A. Riskin, "Optimum bit allocation via the generalized BFOS algorithm," IEEE Transactions on Information Theory, vol. 37, pp. 400-402, Mar. 1991.
4. X. Wu, "Globally optimal bit allocation," in Proceedings Data Compression Conference, (Snowbird, Utah), pp. 22-31, Apr. 1993.
5. K. Ramchandran and M. Vetterli, "Best wavelet packet in a rate-distortion sense," IEEE Trans. Image Processing, vol. 3, pp. 533-545, 1994.
6. K. Dudzinski and S. Walukiewicz, "A fast algorithm for the linear multiple-choice knapsack problem," Operations Research Letters, vol. 3, pp. 205-209, 1984.
7. M. E. Dyer, "An O(n) algorithm for the multiple-choice knapsack linear program," Mathematical Programming, vol. 29, pp. 57-63, May 1984.
8. E. Zemel, "An O(n) algorithm for the linear multiple choice knapsack problem and related problems," Information Processing Letters, vol. 18, pp. 123-128, 1984.
9. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. Chichester, NY: J. Wiley and Sons, 1990.
10. D. Pisinger, Algorithms for Knapsack Problems. Copenhagen, Denmark: University of Copenhagen, 1995.
11. D. G. Kirkpatrick and R. Seidel, "The ultimate planar convex hull algorithm?," SIAM Journal on Computing, vol. 15, no. 2, pp. 287-299, 1986.
12. R. L. Graham, "An efficient algorithm for determining the convex hull of a finite planar set," Information Processing Letters, vol. 1, pp. 132-133, 1972.
13. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, Massachusetts, U.S.A.: M.I.T. Press, 1990.
14. G. N. Frederickson and D. B. Johnson, "The complexity of selection and ranking in X + Y and matrices with sorted columns," Journal of Computer and System Sciences, vol. 24, pp. 197-208, 1982.
15. P. Batra, "Modeling and efficient optimization for object-based scalability and some related problems," IEEE Transactions on Image Processing, vol. 9, pp. 1677-1692, Oct. 2000.