✦ LIBER ✦

On the complexity of building an interval heap

✍ Scribed by Yuzheng Ding; Mark Allen Weiss

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 133 KB
Volume: 50
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00020-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of interval orders and

On the complexity of interval orders and semiorders

✍ U. Faigle; Gy. Turán 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 607 KB

The recognition complexity of interval orders is shown to be Q(n log, n), and an optimal algorithm is given for the identification of semiorders. \* Supported by the joint research project "Algorithmic Aspects of Combinatorial Optimization" of the Hungarian Academy of Sciences (Magyar Tudomanyos Aka

On the approximability of an interval sc

On the approximability of an interval scheduling problem

✍ Frits C. R. Spieksma 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 148 KB 👁 2 views

In this paper we consider a general interval scheduling problem. The problem is a natural generalization of "nding a maximum independent set in an interval graph. We show that, unless P"NP, this maximization problem cannot be approximated in polynomial time within arbitrarily good precision. On the

A note on real vs complex best Chebyshev

A note on real vs complex best Chebyshev approximation on an interval

✍ A.L. Levin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 192 KB

An upper bound on the “dimension of inte

An upper bound on the “dimension of interval orders”

✍ I Rabinovitch 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Complex Zolotarev Polynomials on the Rea

Complex Zolotarev Polynomials on the Real Interval [−1, 1]

✍ C. Detaille; J.P. Thiran 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 321 KB

We consider complex Zolotarev polynomials of degree \(n\) on \([-1,1]\), i.e., monic polynomials of degree \(n\) with the second coefficient assigned to a given complex number \(\rho\), that have minimum Chebyshev norm on \([-1,1]\). They can be characterized either by \(n\) or by \(n+1\) extremal p

On the competitive growth of two sand he

On the competitive growth of two sand heaps

✍ Christina Kuttler 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract A simple quasistationary model for the growth of 1D sand heaps in form of a non‐linear system of ordinary differential equations is presented. The basic assumption for the model is the instantaneous deposition of the matter which is poured by punctiform sources. Existence and uniqueness