336 search results - page 10 / 68 » Approximating Transitivity in Directed Networks |
MOR
2010
13 years 2 months ago
2010
Given an oblique reflection map and functions , Dlim (the space of functions that have left and right limits at every point), the directional derivative () of along , evaluate...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
ISCC
2005
IEEE
14 years 29 days ago
2005
IEEE
Location awareness is an attractive research issue in the wireless sensor network (WSN). However, precise location information may be unavailable due to the constraint in energy, ...
JCT
2008
13 years 7 months ago
2008
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 hypered...