74 search results - page 3 / 15 » Approximating Independent Set in Semi-Random Graphs |
130
Voted
ICALP
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
147
Voted
DCOSS
2008
Springer
15 years 2 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
138
click to vote
PROPERTYTESTING
2010
14 years 10 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
97
Voted
JCT
2007
15 years 9 days ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
129
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...