Claus Viehmann - Dokumente zum Namen - alle Infos bei Yasni.de

(1 - 6 von 7

)

(PDF) Approximating Subdense Instances of Covering Problems -...

pdfslide.us

... University of Bonn Richard Schmied 3 Claus Viehmann 4 Dept. of Computer Science, University of Bonn Abstract We study the approximability of subdense instances of various covering optimiza- tion problems, including Vertex Cover, Connected Vertex Cover, Set Cover, and Steiner Tree problems.

[ v1] Approximating Subdense Instances of Covering Problems

arxiv.org

Title: Approximating Subdense Instances of Covering Problems. Authors: Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann.

[ ] Tight Approximation Bounds for Vertex Cover on Dense...

arxiv.org

Title: Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. Authors: Marek Karpinski, Richard Schmied, Claus Viehmann. (Submitted on 11 Jul 2011). Abstract: We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume...

vdocuments.site

On Approximation Complexity of Metric Dimension Problem� Mathias Hauptmann, Richard Schmied��, and Claus Viehmann�� Dept. of Computer Science, University of…