𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Unified Approach to Approximating Partial Covering Problems

✍ Scribed by Jochen Könemann; Ojas Parekh; Danny Segev

Publisher
Springer
Year
2009
Tongue
English
Weight
518 KB
Volume
59
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Canonical partial least squares—a unifie
Canonical partial least squares—a unified PLS approach to classification and regression problems
✍ Ulf G. Indahl; Kristian Hovde Liland; Tormod Næs 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB 👁 1 views

## Abstract We propose a new data compression method for estimating optimal latent variables in multi‐variate classification and regression problems where more than one response variable is available. The latent variables are found according to a common innovative principle combining PLS methodolog

A unified approach to network location p
A unified approach to network location problems
✍ Nickel, Stefan; Puerto, Justo 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB 👁 2 views

In this paper, we introduce a new type of single-facility location problem on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set for the optimal locations are developed. Also, the extension to the multifaci

Using Homogeneous Weights for Approximat
Using Homogeneous Weights for Approximating the Partial Cover Problem
✍ Reuven Bar-Yehuda 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

In this paper we consider the natural generalizations of two fundamental problems, the Set-Cover problem and the Min-Knapsack problem. We are given a hypergraph, each vertex of which has a nonnegative weight, and each edge of which has a nonnegative length. For a given threshold ˆ , our objective is