|
81 |
1.375-approximation algorithm for sorting by reversals
Berman, Piotr. - Bonn : Inst. für Informatik, 2001
|
|
|
|
82 |
Approximating bounded degree instances of NP hard problems
Karpiński, Marek. - Bonn : Inst. für Informatik, 2001
|
|
|
|
83 |
Approximating minimum unsatisfiability of linear equations
Berman, Piotr. - Bonn : Inst. für Informatik, 2001
|
|
|
|
84 |
Approximating optimal binary trees in parallel
Berman, Piotr. - Bonn : Inst. für Informatik, 2001
|
|
|
|
85 |
Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION
Berman, Piotr. - Bonn : Inst. für Informatik, 2001
|
|
|
|
86 |
Approximation hardness of TSP with bounded metrics
Engebretsen, Lars. - Bonn : Inst. für Informatik, 2001, (Revised version)
|
|
|
|
87 |
Efficient amplifiers and bounded degree optimization
Berman, Piotr. - Bonn : Inst. für Informatik, 2001
|
|
|
|
88 |
Improved approximations for general minimum cost scheduling
Berman, Piotr. - Bonn : Inst. für Informatik, 2001
|
|
|
|
89 |
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Bazgan, Cristina. - Bonn : Inst. für Informatik, 2001
|
|
|
|
90 |
A note on approximating max bisection on regular graphs
Feige, Uriel. - Bonn : Inst. für Informatik, 2000
|
|
Administration
