✦ LIBER ✦

The computational complexity and approximability of a series of geometric covering problems

✍ Scribed by Khachai, M. Yu.; Poberii, M. I.

Book ID: 121371055
Publisher: SP MAIK Nauka/Interperiodica
Year: 2013
Tongue: English
Weight: 482 KB
Volume: 283
Category: Article
ISSN: 0081-5438
DOI: 10.1134/S008154381309006X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity and approximation of the conn

Complexity and approximation of the connected set-cover problem

✍ Wei Zhang, Weili Wu, Wonjun Lee, Ding-Zhu Du 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 246 KB

Computational complexity of the graph ap

Computational complexity of the graph approximation problem

✍ A. A. Ageev; V. P. Il’ev; A. V. Kononov; A. S. Talevnin 📂 Article 📅 2007 🏛 Pleiades Publishing 🌐 English ⚖ 530 KB

The computational complexity of knot and

The computational complexity of knot and link problems

✍ Hass, Joel; Lagarias, Jeffrey C.; Pippenger, Nicholas 📂 Article 📅 1999 🏛 Association for Computing Machinery 🌐 English ⚖ 185 KB

Computing Approximate Solutions of the M

Computing Approximate Solutions of the Maximum Covering Problem with GRASP

✍ Mauricio G.C. Resende 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 140 KB

Padé approximants and noise: A case of g

Padé approximants and noise: A case of geometric series

✍ Jacek Gilewicz; Maciej Pindor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 617 KB

We study effects, on Pad6 approximants (PA), of a random noise added to coefficients of a power series. Numerical experiments performed during the last 30 years have shown that such noise results in the appearance of, the so-called, Froissart doublets (FD) --pairs of zeros and poles separated by a d

A geometric inequality and the complexit

A geometric inequality and the complexity of computing volume

✍ G. Elekes 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 177 KB