๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A 2-approximation algorithm for the network substitution problem

โœ Scribed by Nicolai N. Pisaruk

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
129 KB
Volume
34
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximation algorithm for the group St
Approximation algorithm for the group Steiner network problem
โœ Michal Penn; Stas Rozenfeld ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 143 KB

## Abstract In this article we study the __group Steiner network__ problem, which is defined in the following way. Given a graph __G__ = (__V,E__), a partition of its vertices into K groups and connectivity requirements between the different groups, the aim is to find simultaneously a set of repres

Approximation Algorithms for Network Des
Approximation Algorithms for Network Design Problems on Bounded Subsets
โœ Dorit S. Hochbaum; Joseph (Seffi) Naor ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 141 KB

We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher

A (1โ€“)-approximation algorithm for the g
A (1โ€“)-approximation algorithm for the generalized assignment problem
โœ Zeev Nutov; Israel Beniaminy; Raphael Yuster ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 173 KB

We give a (1-1/e)-approximation algorithm for the max-profit generalized assignment problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best-known approximation ratio for this problem was 1 2