|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-APX-Reports 2000 |
Copyright
2000
Universität Bonn, Institut für Informatik, Abteilung V
|
|
| 8957 |
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems (Extended Version)
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 8958 |
Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT (Revised Version)
W. Fernanadez de la Vega and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 8959 |
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
Uriel Feige, Marek Karpinski and Michael Langberg [Download PostScript] [Download PDF] [Abstract] |
|
| 8960 |
A Note on Approximating MAX-BISECTION on Regular Graphs
Uriel Feige, Marek Karpinski and Michael Langberg [Download PostScript] [Download PDF] [Abstract] |
|
| 8961 |
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs and Planar Graphs
Marek Karpinski, Miroslaw Kowaluk and Andrzej Lingas [Download PostScript] [Download PDF] [Abstract] |
|
| 8962 |
A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs
Klaus Jansen, Marek Karpinski and Andrzej Lingas [Download PostScript] [Download PDF] [Abstract] |
|
| 8963 |
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
Klaus Jansen, Marek Karpinski, Andrzej Lingas and Eike Seidel [Download PostScript] [Download PDF] [Abstract] |
|
| 8964 |
Approximation Hardness of TSP with Bounded Metrics
Lars Engebretsen and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 8965 |
Approximability of Dense Instances of NEAREST CODEWORD Problem
Cristina Bazgan, W.Fernandez de la Vega and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
02/04/03 at 10:27:53
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |