331 search results - page 39 / 67 » Approximation Algorithms for Connected Dominating Sets |
SIGCOMM
1999
ACM
15 years 4 months ago
1999
ACM
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...
118
click to vote
ICCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
101
click to vote
FPGA
2000
ACM
15 years 3 months ago
2000
ACM
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
101
click to vote
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
IJCAI
2007
15 years 1 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...