Table rounding problem

Computers and Artificial Intelligence

Volumn 18, Issue 2, 1999, Pages 175-189

  Šíma, Jiří ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Adjacent integer; Check sum; Maximum flow; Minimum cost flow problem; Minimum cut; Rounding; Table

Indexed keywords

EID: 33748739846     PISSN: 02320274     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. BARANYAI, ZS.: On the Factorization of the Complete Uniform Hypergraph. In: A. Hajnal, R. Rado, V. T. Sós (Eds.): Infinite and Finite Sets, Colloquia Math. Soc. János Bolyai, North-Holland, Vol. 10, 1975, pp. 91-107.
2. BECK, J. - FIALA, T.: "Integer-Making" Theorems. Discrete Applied Mathematics, Vol. 3, 1981, pp. 1-8.
3. FORD, L. R. - FULKERSON, D. R.: Flows in Networks. Princeton Press, Princeton, 1962.
4. JENSEN, P. A. - BARNES, J. W.: Network Flow Programming. John Wiley & Sons, New York, 1980.
5. KARP, R. M. - LEIGHTON, F. T. - RIVEST, R. L. - THOMPSON, C. D. - VAZIRANI, U. V. - VAZIRANI, V. V.: Global Wire Routing in Two-Dimensional Arrays. Algorithmica, Vol. 2, 1987, pp. 113-129.
6. KUČERA, L.: Combinatorial Algorithms. MS 18, SNTL, Prague, 1983 (in Czech).
7. LAWLER, E. L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
8. SCARBOROUGH, J. B.: Numerical Mathematical Analysis. John Hopkins Press, Baltimore, 1930.
9. rd SOFSEM Seminar on Current Trends in Theory and Practice of Informatics, Milovy, LNCS 1175, Springer-Verlag, Berlin, 1996, pp. 441-450.
10. TANNERY, J.: Lecons d'Arithmetique. Colin, Paris, 1894.