Richard Schmied

According to our database, Richard Schmied authored at least 12 papers between 2011 and 2015.

Collaborative distances:

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

2015

Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs.

Marek Karpinski, Richard Schmied, Claus Viehmann

J. Discrete Algorithms, 2015

New inapproximability bounds for TSP.

Marek Karpinski, Michael Lampis, Richard Schmied

J. Comput. Syst. Sci., 2015

2013

On Approximability of Bounded Degree Instances of Selected Optimization Problems.

Richard Schmied

PhD thesis, 2013

Approximation Hardness of Graphic TSP on Cubic Graphs.

Marek Karpinski, Richard Schmied

Electron. Colloquium Comput. Complex., 2013

Improved Inapproximability Results for the Shortest Superstring and Related Problems.

Marek Karpinski, Richard Schmied

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

2012

Approximating edge dominating set in dense graphs.

Richard Schmied, Claus Viehmann

Theor. Comput. Sci., 2012

Approximation complexity of Metric Dimension problem.

Mathias Hauptmann, Richard Schmied, Claus Viehmann

J. Discrete Algorithms, 2012

Approximating vertex cover in dense hypergraphs.

Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann

J. Discrete Algorithms, 2012

On Approximation Lower Bounds for TSP with Bounded Metrics.

Marek Karpinski, Richard Schmied

Electron. Colloquium Comput. Complex., 2012

2011

Approximating Subdense Instances of Covering Problems.

Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann

Electron. Notes Discret. Math., 2011

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

Marek Karpinski, Richard Schmied, Claus Viehmann

Electron. Colloquium Comput. Complex., 2011

Improved Lower Bounds for the Shortest Superstring and Related Problems.

Marek Karpinski, Richard Schmied

Electron. Colloquium Comput. Complex., 2011