Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 2011 Copyright 2011 Universität Bonn, Institut für Informatik, Abteilung V

89129 Approximability of Vertex Cover in Dense Bipartite Hypergraphs
Jean Cardinal, Marek Karpinski, Richard Schmied and Claus Viehmann
[Download PostScript] [Download PDF] [Abstract]
89130 Approximation Schemes for the Betweenness Problem in Tournaments
and Related Ranking Problems (Revised Version)

Marek Karpinski and Warren Schudy
[Download PostScript] [Download PDF] [Abstract]
89131 Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
Marek Karpinski, Richard Schmied and Claus Viehmann
[Download PostScript] [Download PDF] [Abstract]
89132 On Stability of Banking Networks
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
89133 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
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope