𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the approximability of the link building problem

✍ Scribed by Olsen, Martin; Viglas, Anastasios

Book ID
122807752
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
443 KB
Volume
518
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the approximability of the Steiner tr
On the approximability of the Steiner tree problem
✍ Martin Thimm πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 165 KB

We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400 . The reduction is from H astad's nonapproximability result for maximum satisΓΏability of linear equation modulo 2. The improvement on the

Approximability of the Firefighter Probl
Approximability of the Firefighter Problem
✍ Elliot Anshelevich; Deeparnab Chakrabarty; Ameya Hate; Chaitanya Swamy πŸ“‚ Article πŸ“… 2010 πŸ› Springer 🌐 English βš– 600 KB
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