✦ LIBER ✦

A polynomial-time approximation to optimal multivariate microaggregation

✍ Scribed by Josep Domingo-Ferrer; Francesc Sebé; Agusti Solanas

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 493 KB
Volume: 55
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.04.034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial Time Approximation Scheme f

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

✍ Bang Ye Wu; Kun-Mao Chao; Chuan Yi Tang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Given an undirected graph with nonnegative edge lengths and nonnegative vertex weights, the routing requirement of a pair of vertices is assumed to be the product of their weights. The routing cost for a pair of vertices on a given spanning tree is defined as the length of the path between them mult

Whitney Estimates for Convex Domains wit

Whitney Estimates for Convex Domains with Applications to Multivariate Piecewise Polynomial Approximation

✍ S. Dekel; D. Leviatan 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 361 KB

MAX SAT approximation beyond the limits

MAX SAT approximation beyond the limits of polynomial-time approximation

✍ Evgeny Dantsin; Michael Gavrilovich; Edward A. Hirsch; Boris Konev 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 119 KB

A polynomial time approximation algorith

A polynomial time approximation algorithm for dynamic storage allocation

✍ H.A. Kierstead 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Strongly polynomial-time approximation f

Strongly polynomial-time approximation for a class of bicriteria problems

✍ Asaf Levin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Makespan minimization in open shops: A p

Makespan minimization in open shops: A polynomial time approximation scheme

✍ Sergey V. Sevastianov; Gerhard J. Woeginger 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 510 KB