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

Approximation algorithms for channel allocation problems in broadcast networks

โœ Scribed by Rajiv Gandhi; Samir Khuller; Aravind Srinivasan; Nan Wang

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
211 KB
Volume
47
Category
Article
ISSN
0028-3045

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

Approximation Algorithms for Maximizatio
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
โœ Uriel Feige; Michael Langberg ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 261 KB

Given a graph G = V E , a weight function w E โ†’ R + , and a parameter k, we consider the problem of finding a subset U โŠ† V of size k that maximizes: Max-Vertex Cover k the weight of edges incident with vertices in U, Max-Dense Subgraph k the weight of edges in the subgraph induced by U, Max-Cut k th

An expanded maximum neural network algor
An expanded maximum neural network algorithm for a channel assignment problem in cellular radio networks
โœ Katsuyoshi Ikenaga; Yoichi Takenaka; Nobuo Funabiki ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 247 KB ๐Ÿ‘ 2 views

In this paper, we propose a neural network algorithm that uses the expanded maximum neuron model to solve the channel assignment problem of cellular radio networks, which is an NP-complete combinatorial optimization problem. The channel assignment problem demands minimizing the total interference be