|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-Reports 2009 |
Copyright 2009 Universität Bonn,
Institut für Informatik, Abteilung V
|
|
| 85301 |
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications Piotr Berman, Marek Karpinski and Andrzej Lingas [Download PostScript] [Download PDF] [Abstract] |
|
| 85302 |
Cycles and Paths in Edge-Colored Graphs with Given Degrees
A. Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. Martinhon and Rachid Saad [Download PostScript] [Download PDF] [Abstract] |
|
| 85303 |
Approximating Transitive Reductions for Directed Networks (Revised Version)
Piotr Berman, Bhaskar DasGupta and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85304 |
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
Gábor Ivanyos, Marek Karpinski and Nitin Saxena [Download PostScript] [Download PDF] [Abstract] |
|
| 85305 |
The Complexity of Perfect Matching Problems on Dense Hypergraphs
Marek Karpinski, Andrzej Rucinski and Edyta Szymanska [Download PostScript] [Download PDF] [Abstract] |
|
| 85306 |
The Mixing Time of Glauber Dynamics for Colouring Regular Trees (Revised Version)
Leslie Ann Goldberg, Mark Jerrum and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85307 |
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems Marek Karpinski and Warren Schudy [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
11/06/09 at 11:57:53
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |