|
71 |
Approximation schemes for metric minimum bisection and partitioning
Fernandez de la Vega, Wenceslas. - Bonn : Inst. für Informatik, 2003
|
|
|
|
72 |
Improved approximation algorithms for the quality of service Steiner tree problem
Bonn : Inst. für Informatik, 2003
|
|
|
|
73 |
On approximability of minimum bisection and related partition problems
Karpiński, Marek. - Bonn : Inst. für Informatik, 2003
|
|
|
|
74 |
9/8-approximation algorithm for random MAX-3SAT
Fernandez de la Vega, Wenceslas. - Bonn : Inst. für Informatik, 2002
|
|
|
|
75 |
A polynomial time approximation scheme for metric MIN-BISECTION
Fernandez de la Vega, Wenceslas. - Bonn : Inst. für Informatik, 2002
|
|
|
|
76 |
A polynomial time approximation scheme for subdense MAX-CUT
Fernandez de la Vega, Wenceslas. - Bonn : Inst. für Informatik, 2002
|
|
|
|
77 |
Approximating Huffman codes in parallel
Berman, Piotr. - Bonn : Inst. für Informatik, 2002, (Rev. version)
|
|
|
|
78 |
Aproximability of the minimum bisection problem
Karpiński, Marek. - Bonn : Inst. für Informatik, 2002
|
|
|
|
79 |
Parallel construction of the minimum redundancy length limited codes
Karpiński, Marek. - Bonn : Inst. für Informatik, 2002
|
|
|
|
80 |
Polynomial time approximation schemes for metric MIN-BISECTION
Fernandez de la Vega, Wenceslas. - Bonn : Inst. für Informatik, 2002, Extended version
|
|
Administration
