Matrix Rounding With Respect to Small Submatrices

Doerr, Benjamin

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Matrix Rounding With Respect to Small Submatrices

MPS-Authors

/persons/resource/persons44338

Doerr, Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Doerr, B. (2006). Matrix Rounding With Respect to Small Submatrices. Random Structures & Algorithms, 28, 107-112.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2365-1

Abstract

We show that any real valued matrix A can be rounded to an integer one B such that the error in all 2 × 2 (geometric) submatrices is less than 1.5, that is, we have |aij - bij| < 1 and for all i,j.