𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The jump number problem on interval orders: A 32 approximation algorithm

✍ Scribed by Maciej M. Sysło

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
556 KB
Volume
144
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A robust algorithm for the solution of e
A robust algorithm for the solution of electromagnetic problems over a frequency interval via the Padé approximation
✍ Mustafa Kuzuoglu; Raj Mittra 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB 👁 2 views

In this paper, we present an efficient and systematic algorithm for the solution of electromagnetic scattering and radiation problems o¨er a wide frequency inter¨al. The algorithm is based on the e¨aluation of the Pade approximant of the solution ¨ector, constructed át a minimum number of expansion

A simpleO(n2) algorithm for the all-pair
A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph
✍ Mirchandani, Prakash 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 3 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a

The Problem of A. F. Timan on the Precis
The Problem of A. F. Timan on the Precise Order of Decrease of the Best Approximations
✍ R.K.S. Rathore 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 470 KB

The problem of Timan on finding a necessary and sufficient condition for \(A_{\sigma}(f)_{L_{q}} \sim \omega_{k}(f ; 1 / \sigma)_{L_{q}}, \sigma \rightarrow \infty\), is solved. The condition is \(\omega_{k}(f ; \delta)_{L_{q}} \sim \omega_{k+1}(f ; \delta)_{L_{q}}\), \(\delta \rightarrow 0\). Relat