𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation algorithm for the Generalized -Multicut problem

✍ Scribed by Peng Zhang; Daming Zhu; Junfeng Luan

Book ID
113564782
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
261 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation Algorithms for Steiner and
Approximation Algorithms for Steiner and Directed Multicuts
✍ Philip N Klein; Serge A Plotkin; Satish Rao; Γ‰va Tardos πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 277 KB

In this paper we consider the Steiner multicut problem. This is a generalization of the minimum multicut problem where instead of separating node pairs, the goal is to find a minimum weight set of edges that separates all given sets of nodes. A set is considered separated if it is not contained in a

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