Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 2011 Copyright 2011 University of Bonn, Department of Computer Science, Chair V

85319 Approximability of Vertex Cover in Dense Bipartite Hypergraphs
Jean Cardinal, Marek Karpinski, Richard Schmied and Claus Viehmann
[Download PostScript] [Download PDF] [Abstract]
85320 A Conjecture about Homogeneous and Antisymmetric m-Schemes
Manuel Arora
[Download PostScript] [Download PDF] [Abstract]
85321 Approximation Schemes for the Betweenness Problem in Tournaments
and Related Ranking Problems (Revised Version)

Marek Karpinski and Warren Schudy
[Download PostScript] [Download PDF] [Abstract]
85322 Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
Marek Karpinski, Richard Schmied and Claus Viehmann
[Download PostScript] [Download PDF] [Abstract]
85323 On Stability of Banking Networks
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85324 Improved Lower Bounds for the Shortest Superstring and Related Problems
Marek Karpinski and Richard Schmied
[Download PostScript] [Download PDF] [Abstract]
Last Change: 11/23/11 at 15:52:53
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V