ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (183 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ejc.2005.09.006    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2005 Elsevier Ltd All rights reserved.

Matrix approximation and Tusnády’s problem

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Benjamin Doerra

aMax-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany


Received 26 October 2004; 
accepted 29 September 2005. 
Available online 18 January 2006.

Abstract

We consider the problem of approximating a given matrix by an integer one such that in all geometric submatrices the sum of the entries does not change by much. We show that for all integers m,n≥2 and real matrices View the MathML source there is an integer matrix View the MathML source such that

View the MathML source
holds for all intervals Isubset of or equal to[m], Jsubset of or equal to[n]. Such a matrix can be computed in time O(mnlog(min{m,n})). The result remains true if we add the requirement |aijbij|<2 for all iset membership, variant[m],jset membership, variant[n]. This is surprising, as the slightly stronger requirement |aijbij|<1 makes the problem equivalent to Tusnády’s problem.

Article Outline

1. Introduction and results
1.1. Matrix rounding problems
1.2. Tusnády’s problem
1.3. Our results
2. Proof of the main result
References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.