Subtotally positive and Monge matrices

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and its output is the maximum element of that submatrix. Our data structure for an n × n Monge matrix takes O(n log n) space, O(n log n) preprocessing time, and can answer queries in O(log n) time. For a Monge partial matrix ...

متن کامل

Monge matrices make maximization manageable

We continue the research on the eeects of Monge structures in the area of combinatorial optimization. We show that three optimization problems become easy if the underlying cost matrix fulllls the Monge property: (A) The balanced max{cut problem, (B) the problem of computing minimum weight binary k-matchings and (C) the computation of longest paths in bipartite, edge-weighted graphs. In all thr...

متن کامل

Improved Submatrix Maximum Queries in Monge Matrices

We present efficient data structures for submatrix maximum queries in Monge matrices and Monge partial matrices. For n× n Monge matrices, we give a data structure that requires O(n) space and answers submatrix maximum queries in O(logn) time. The best previous data structure [Kaplan et al., SODA‘12] required O(n logn) space and O(log n) query time. We also give an alternative data structure wit...

متن کامل

Singular value inequalities for positive semidefinite matrices

In this note‎, ‎we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique‎. ‎Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl‎. ‎308 (2000) 203-211] and [Linear Algebra Appl‎. ‎428 (2008) 2177-2191]‎.

متن کامل

A note on positive deniteness and stability of interval matrices

It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2006

ISSN: 0024-3795

DOI: 10.1016/j.laa.2005.08.020