On the complexities of the optimal rounding problems of sequences and matrices

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

Volumn 1851, Issue , 2000, Pages 476-489

  Asano, Tetsuo ^a   Matsui, Tomomi ^b   Tokuyama, Takeshi ^c  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

^c TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATE RATIO; APPROXIMATE SOLUTION; INPUT SEQUENCE; MATRIX ROUNDING; POLYNOMIAL-TIME ALGORITHMS; RECTANGULAR REGIONS; ROUNDING PROBLEM; WEIGHT FUNCTIONS;

ALGORITHMS;

EID: 84956862020     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (21)

1. R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan: “Faster algorithms for the shortest path problems," Journal of ACM, 37 (1990), pp. 213-223.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Theory Algorithms and Applications, Princeton Hall, 1993.
3. T. Asano, D. Z. Chen, N. Katoh, and T. Tokuyama: “Polynomial-time solutions to image segmentation," Proc. of the 7th ACM-SIAM Symposium on Discrete Algorithms (1996), pp. 104-113.
4. T. Asano, N. Katoh, H. Tamaki, and T. Tokuyama: “Convertibility among grid filling curves," Proc. ISAAC98, Springer LNCS 1533 (1998), pp. 307-316.
5. T. Asano, D. Ranjan and T. Roos: "Digital halftoning algorithms based on optimization criteria and their experimental evaluation," IEICE Trans. Fundamentals, Vol. E79-A (1996), No. 4, pp. 524-532.
6. B. E. Bayer: “An optimum method for two-level rendition of continuous-tone pictures," Conference Record, IEEE International Conference on Communications, 1 (1973), pp. (26-11)-(26-15).
7. Z. Baranyai, “On the factorization of the complete uniform hypergraphs", in In-finite and Finite Sets, eds. A. Hanaj, R. Rado and V. T. Sós, Colloq. Math. Soc. J'anos Bolyai 10 (1974), pp.91-108.
8. B. Bollobás, Combinatorics, Cambridge University Press, 1986.
9. J. Beck and W. Chen, Irregularities of Distribution, Cambridge University Press, Cambridge, 1987.
10. J. Beck and V. T. Sös, Discrepancy Theory, in Handbook of Combinatorics Volume II, (ed. R.Graham, M. Grötschel, and L Lovász) 1995, Elsevier.
11. T. H. Cormen, C. E. Leiserson, R. L. Rivest: Introduction to Algorithms, MIT Press, 1989.
12. Y. Crama, P. Hansen and B. Jaumard: “The basic algorithm for pseudo-Boolean programming revisited," Discrete Applied Mathematics, 29 (1990), pp. 171-185.
13. R. W. Floyd and L. Steinberg: “An adaptive algorithm for spatial gray scale," SID 75 Digest, Society for Information Display (1975), pp. 36-37.
14. H. N. Gabow and R. E. Tarjan: “Faster scaling algorithms for network problems," SIAM J. Comp., 18 (1989), pp. 1013-1036.
15. M. R. Garey and D. S. Johnson: Computers and Intractability: A guide to theory of NP hardness, Freeman and Company, 1979.
16. D. E. Knuth: “Digital halftones by dot diffusion," ACM Trans. Graphics, 6-4 (1987), pp. 245-273.
17. J. O. Limb: “Design of dither waveforms for quantized visual signals," Bell Syst. Tech. J., 48-7 (1969), pp. 2555-2582.
18. B. Lippel and M. Kurland: “The effect of dither on luminance quantization of pictures," IEEE Trans. Commun. Tech., COM-19 (1971), pp.879-888.
19. V. Rödl and P. Winkler: “Concerning a matrix approximation problem", Crux Mathmaticorum, 1990, pp. 76-79.
20. R. Ulichney: Digital halftoning, MIT Press, 1987.
21. A. J. Viterbi: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm IEEE Transactions on Information Theory Vol. IT-13 (1967), pp.260-267.