Richard Schmied

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Approximation hardness of graphic TSP on cubic graphs RAIRO - Operations Research	2015-10-20	Paper
New inapproximability bounds for TSP Journal of Computer and System Sciences	2015-08-31	Paper
Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs Journal of Discrete Algorithms	2015-08-18	Paper
New inapproximability bounds for TSP Algorithms and Computation	2014-01-14	Paper
Approximating subdense instances of covering problems Electronic Notes in Discrete Mathematics	2013-07-23	Paper
Approximation complexity of metric dimension problem Journal of Discrete Algorithms	2012-09-13	Paper
Approximating vertex cover in dense hypergraphs Journal of Discrete Algorithms	2012-09-13	Paper
Approximating edge dominating set in dense graphs Theoretical Computer Science	2012-03-13	Paper
Approximating edge dominating set in dense graphs Lecture Notes in Computer Science	2011-07-01	Paper
On approximation complexity of metric dimension problem Lecture Notes in Computer Science	2011-05-19	Paper

Research outcomes over time

This page was built for person: Richard Schmied