𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximability of the Firefighter Problem

✍ Scribed by Elliot Anshelevich; Deeparnab Chakrabarty; Ameya Hate; Chaitanya Swamy

Book ID
106149168
Publisher
Springer
Year
2010
Tongue
English
Weight
600 KB
Volume
62
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximability of the k-server disconne
Approximability of the k-server disconnection problem
✍ Sung-Pil Hong; Byung-Cheon Choi πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 332 KB

## Abstract Consider a network of __k__ servers and their users. Each server provides a unique service that has a certain utility for each user. Now comes an attacker who wishes to destroy a set of network edges to maximize his net gain, namely the total disconnected utilities of the users minus th

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

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