447 search results - page 62 / 90 » Approximation Algorithms for Directed Steiner Problems |
110
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
102
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
122
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
118
click to vote
ICCS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
STOC
2004
ACM
16 years 1 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...