459 search results - page 10 / 92 » Approximation Algorithms for Buy-at-Bulk Geometric Network D... |
SODA
2000
ACM
13 years 10 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
MOBIHOC
2007
ACM
14 years 8 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...