✦ LIBER ✦

On the multi-radius cover problem

✍ Scribed by Julián Mestre

Book ID: 108153463
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 101 KB
Volume: 99
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2006.04.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The variable radius covering problem

✍ Oded Berman; Zvi Drezner; Dmitry Krass; George O. Wesolowsky 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 258 KB

The complexity of the covering radius pr

The complexity of the covering radius problem

✍ Venkatesan Guruswami; Daniele Micciancio; Oded Regev 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 340 KB

Frobenius Problem and the Covering Radiu

Frobenius Problem and the Covering Radius of a Lattice

✍ Lenny Fukshansky; Sinai Robins 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 225 KB

The Conditional Covering Problem on Unwe

The Conditional Covering Problem on Unweighted Interval Graphs with Nonuniform Coverage Radius

✍ Akul Rana; Anita Pal; Madhumangal Pal 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

An optimal polynomial for a covering rad

An optimal polynomial for a covering radius problem

✍ Jyrki Lahtonen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 228 KB

The multi-integer set cover and the faci

The multi-integer set cover and the facility terminal cover problem

✍ Dorit S. Hochbaum; Asaf Levin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

## Abstract The facility terminal cover problem is a generalization of the vertex cover problem. The problem is to “cover” the edges of an undirected graph __G__ = (__V__,__E__) where each edge __e__ is associated with a non‐negative demand __d__~__e__~. An edge __e__ = __u__,__v__ is covered if at