239 search results - page 22 / 48 » Hardness and algorithms for rainbow connection |
133
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
IMC
2006
ACM
15 years 5 months ago
2006
ACM
While the problem of analyzing network traffic at the granularity of individual connections has seen considerable previous work and tool development, understanding traffic at a ...
116
click to vote
SIGMOD
2010
ACM
14 years 12 months ago
2010
ACM
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
110
click to vote
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
120
click to vote
APNOMS
2006
Springer
15 years 3 months ago
2006
Springer
Setting up an IDS architecture on ad-hoc network is hard because it is not easy to find suitable locations to setup IDS's. One way is to divide the network into a set of clust...