Skip to main content
SpringerLink
Log in

Aunt's problem: Table rounding

  • Contributed Papers
  • Conference paper
  • First Online:
SOFSEM'96: Theory and Practice of Informatics (SOFSEM 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1175))

  • 123 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jensen, P. A., Barnes, J. W. 1980. Network Flow Programming. John Wiley & Sons, New York.

    Google Scholar 

  2. Kučera, L. 1983. Combinatorial Algorithms. (in czech) MS 18, SNTL, Prague.

    Google Scholar 

  3. Lawler, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical Informatics Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod vodárenskou věží 2, 182 07, Prague 8, Czech Republic

    Jiří Šíma

Authors
  1. Jiří Šíma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Keith G. Jeffery Jaroslav Král Miroslav Bartošek

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Šíma, J. (1996). Aunt's problem: Table rounding. In: Jeffery, K.G., Král, J., Bartošek, M. (eds) SOFSEM'96: Theory and Practice of Informatics. SOFSEM 1996. Lecture Notes in Computer Science, vol 1175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037428

Download citation

  • DOI: https://doi.org/10.1007/BFb0037428

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61994-9

  • Online ISBN: 978-3-540-49588-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation