Department of Computer Science
 
Chair V

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

8995 Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
Magnus Bordewich, Martin Dyer and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8996 TSP with Bounded Metrics: Stronger Approximation Hardness
Lars Engebretsen and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8997 Tensor Decomposition and Approximation Schemes for Constraint Satisfaction Problems
Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski and Santosh Vempala
[Download PostScript] [Download PDF] [Abstract]
8998 On the Complexity of Global Constraint Satisfaction
Cristina Bazgan and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8999 8/7-Approximation Algorithm for (1,2)-TSP
Piotr Berman and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
89100 Metric Construction, Stopping Times and Path Coupling
Magnus Bordewich, Martin Dyer and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
Last Change: 12/12/05 at 13:51:10
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V