534 search results - page 80 / 107 » Tight approximation algorithm for connectivity augmentation ... |
110
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
131
Voted
PODC
2011
ACM
14 years 5 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
113
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
149
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
93
Voted
WINET
2008
15 years 2 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...