Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 2016 Copyright 2016 Universität Bonn, Institut für Informatik, Abt. V
89165

29.02.2016

Approximation Complexity of Max-Cut on Power Law Graphs
Mikael Gast, Mathias Hauptmann, Marek Karpinski
[Download PostScript] [Download PDF]

In this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent β. We prove some new approximability results on that problem. In particular we show that there exist polynomial time approximation schemes (PTAS) for MAX-CUT on PLGs for the power law exponent β in the interval (0,2). For β>2 we show that for some ϵ>0, MAX-CUT is NP-hard to approximate within approximation ratio 1+ϵ, ruling out the existence of a PTAS in this case. Moreover we give an approximation algorithm with improved constant approximation ratio for the case of β>2.

Last Change: 02/29/16 at 10:00:46
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope