393 search results - page 6 / 79 » Approximation Algorithm for Directed Telephone Multicast Pro... |
100
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
118
click to vote
HSNMC
2003
Springer
15 years 2 months ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
NETWORKING
2007
14 years 11 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
117
click to vote
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...