✦ LIBER ✦

Two algorithms for smooth many-dimensional approximation in physics

✍ Scribed by N. Bogdanova; T. Kupenova

Book ID: 107745499
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 724 KB
Volume: 73
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(92)90037-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for the oriente

Approximation algorithms for the oriented two-dimensional bin packing problem

✍ Andrea Lodi; Silvano Martello; Daniele Vigo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB

A 3-approximation algorithm for two-dime

A 3-approximation algorithm for two-dimensional bin packing

✍ Guochuan Zhang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 189 KB

In the classical two-dimensional bin packing problem one is asked to pack a set of rectangular items, without overlap and without any rotation, into the minimum number of identical square bins. We give an approximation algorithm with absolute worst-case ratio of 3.

Algorithm 35 an algorithm for non-smooth

Algorithm 35 an algorithm for non-smoothing contour representations of two-dimensional arrays

✍ Hildegrad Schultheis; R. Schultheis 📂 Article 📅 1978 🏛 Springer Vienna 🌐 English ⚖ 309 KB

An approximation algorithm for solving u

An approximation algorithm for solving unconstrained two-dimensional knapsack problems

✍ Didier Fayard; Vassilis Zissimopoulos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 940 KB

Optimal algorithms for the many-to-one r

Optimal algorithms for the many-to-one routing problem on two-dimensional meshes

✍ Fillia Makedon; Antonios Symvonis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 749 KB

Subquadratic Approximation Algorithms fo

Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces

✍ Allan Borodin; Rafail Ostrovsky; Yuval Rabani 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 156 KB