Mikael Gast

According to our database, Mikael Gast authored at least 7 papers between 2012 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Approximation Complexity of Max-Cut on Power Law Graphs.

Mikael Gast, Mathias Hauptmann, Marek Karpinski

CoRR, 2016

2015

Inapproximability of dominating set on power law graphs.

Mikael Gast, Mathias Hauptmann, Marek Karpinski

Theor. Comput. Sci., 2015

Approximability of TSP on Power Law Graphs.

Mikael Gast, Mathias Hauptmann, Marek Karpinski

CoRR, 2015

2014

Approximability of the vertex cover problem in power-law graphs.

Mikael Gast, Mathias Hauptmann

Theor. Comput. Sci., 2014

2013

Approximability of Combinatorial Optimization Problems on Power Law Networks.

Mikael Gast

PhD thesis, 2013

2012

Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs and Some Generalizations

Mikael Gast, Mathias Hauptmann, Marek Karpinski

CoRR, 2012

Efficient Parallel Computation of Nearest Neighbor Interchange Distances

Mikael Gast, Mathias Hauptmann

CoRR, 2012