1 - 10 of 35 articles
be real numbers with∑
|, and ∑
|)=A>0, wheref is a continuous, strictly increasing function on [0, ∞) withf(0)=0. Using a generalized Chebycheff inequality (or directly) it is easy to see that an upper bound for |x...
An algorithm is presented for finding annth-best spanning tree of an edge-weighted graphG. In sharp contrast to related ranking algorithms, the number of steps is a linear function of the parametern. The results apply as well to ranking the bases of an abstract matroid.
Throughout this paper Greek indicesα, β, ⋯, and Latin indicesi, j, h, k, assume the values 1, ⋯,m, and 1, ⋯,n respectively. The summation convention is operative in respect of both sets of indices.
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.