Sciweavers

298 search results - page 13 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
SIAMDM
2008
139views more  SIAMDM 2008»
14 years 9 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
MOBIHOC
2007
ACM
15 years 9 months ago
The multicast capacity of large multihop wireless networks
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
Srinivas Shakkottai, Xin Liu, R. Srikant
JUCS
2008
170views more  JUCS 2008»
14 years 9 months ago
Intelligent Resource Exchanges: Solutions and Pathways in a Workforce Allocation Problem
: This paper considers the problem of resource allocation in the service industries approached from an agent-based perspective. Agent technologies seem to be well suited to this do...
Botond Virginas, Marian Florin Ursu, Edward P. K. ...
CORR
2011
Springer
221views Education» more  CORR 2011»
14 years 4 months ago
Course on System Design (structural approach)
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
Mark Sh. Levin
COCOON
2008
Springer
14 years 11 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi