632 search results - page 81 / 127 » On the Approximability of the Steiner Tree Problem |
161
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
167
click to vote
MOBIHOC
2007
ACM
16 years 5 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
149
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
168
click to vote
SIAMCOMP
2000
15 years 5 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
161
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...