Sciweavers

791 search results - page 7 / 159
» Approximating the Maximum Sharing Problem
Sort
View
ADHOCNOW
2004
Springer
14 years 29 days ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
IEICET
2010
124views more  IEICET 2010»
13 years 4 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
Ruka Tanahashi, Zhi-Zhong Chen
IPL
2006
79views more  IPL 2006»
13 years 7 months ago
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...
COCOON
2006
Springer
13 years 11 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
14 years 1 months ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...