Richard Schmied

J. Discrete Algorithms, 2015

2013

On Approximability of Bounded Degree Instances of Selected Optimization Problems.

[BibT_eX]

[DOI]

PhD thesis, 2013

Approximation Hardness of Graphic TSP on Cubic Graphs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

New Inapproximability Bounds for TSP.

[BibT_eX]

[DOI]

Michael Lampis

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Improved Inapproximability Results for the Shortest Superstring and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Computing: The Australasian Theory Symposium, 2013

2012

Approximating vertex cover in dense hypergraphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

On Approximation Lower Bounds for TSP with Bounded Metrics.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

2011

Approximating Subdense Instances of Covering Problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Improved Lower Bounds for the Shortest Superstring and Related Problems.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Approximating Edge Dominating Set in Dense Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2011

2010

On Approximation Complexity of Metric Dimension Problem.

[BibT_eX]

[DOI]

Mathias Hauptmann