331 search results - page 55 / 67 » Approximation Algorithms for Connected Dominating Sets |
80
Voted
STOC
2002
ACM
16 years 17 hour ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
108
click to vote
PODS
2007
ACM
15 years 12 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
74
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
STOC
2001
ACM
16 years 17 hour ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...