274 search results - page 34 / 55 » The Polymatroid Steiner Problems |
108
click to vote
INFOCOM
1995
IEEE
15 years 4 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
CORR
2008
Springer
15 years 24 days ago
2008
Springer
We address the problem of curvature estimation from sampled compact sets. The main contribution is a stability result: we show that the Gaussian, mean or anisotropic curvature mea...
74
Voted
IPL
2010
14 years 11 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
117
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
84
Voted
SIAMDM
2010
14 years 11 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...