Sciweavers

34 search results - page 5 / 7
» Constructing exact octagonal steiner minimal trees
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
13 years 7 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
INFOCOM
1999
IEEE
13 years 11 months ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
MOBIHOC
2006
ACM
14 years 7 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
JCO
2008
117views more  JCO 2008»
13 years 7 months ago
Approximation algorithms for connected facility location problems
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
ISPD
2003
ACM
117views Hardware» more  ISPD 2003»
14 years 18 days ago
Fishbone: a block-level placement and routing scheme
A block-level placement and routing scheme called Fishbone is presented. The routing uses a two-layer spine topology. The pin locations are configurable and restricted to certain ...
Fan Mo, Robert K. Brayton