6 citations · 6 across the 2 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012
Inapproximability of Dominating Set in Power Law Graphs
Mikael Gast, Mathias Hauptmann, Marek Karpinski
We give logarithmic lower bounds for the approximability of the Minimum Dominating Set problem in connected (alpha,beta)-Power Law Graphs. We give also a best up to now upper appro…
cs.CC2012★ 6 cited
Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations
Mikael Gast, Mathias Hauptmann, Marek Karpinski
We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend…