7930 search results - page 28 / 1586 » Greedy in Approximation Algorithms |
165
click to vote
IPTPS
2004
Springer
15 years 11 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
145
click to vote
PODC
2006
ACM
15 years 11 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
132
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations. We propose a new automated system for se...
164
click to vote
EOR
2008
15 years 6 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
159
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...