|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-Reports 2001 |
Copyright 2001 Universität Bonn,
Institut für Informatik, Abteilung V
|
|
| 85222 |
Approximating Minimum Unsatisfiability of Linear Equations
Piotr Berman and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85223 |
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
Piotr Berman and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85224 |
Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction
Cristina Bazgan, W. Fernandez de la Vega and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85225 |
RAND-APX-Workshop on Approximation Intractability joint with the Workshop Design and Analysis of Randomized and Approximation Algorithms, Dagstuhl, June 3 - 8, 2001
Martin Dyer, Mark Jerrum and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85226 |
Approximating Bounded Degree Instances of NP-Hard Problems
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85227 |
Approximation Hardness of TSP with Bounded Metrics (Revised Version)
Lars Engebretsen and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85228 |
1.375-Approximation Algorithm for Sorting by Reversals
Piotr Berman, Sridhar Hannenhalli and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85229 |
Approximating Optimal Binary Trees in Parallel
Piotr Berman, Marek Karpinski and Yakov Nekrich [Download PostScript] [Download PDF] [Abstract] |
|
| 85230 |
Efficient Amplifiers and Bounded Degree Optimization
Piotr Berman and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85231 |
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms
Norbert Blum [Download PostScript] [Download PDF] [Abstract] |
|
| 85232 |
A Simplified Realization of the Hopcroft-Karp Approach to Maximum Matching in General Graphs
Norbert Blum [Download PostScript] [Download PDF] [Abstract] |
|
| 85233 |
Improved Approximations for General Minimum Cost Scheduling
Piotr Berman and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85234 |
Random Sampling and Approximation of MAX-CSP Problems
Noga Alon, W. Fernandez de la Vega, Ravi Kannan and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
08/16/04 at 12:33:28
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |