Abstract
We show that the linear discrepancy of a basic totally unimodular matrix $A \in R^{m \times n}$ is at most $1- {1\over {n+1}}$. This extends a result of Peng and Yan.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
