| Talking persons: |
| Tobias Baumann |
| Abstract: |
| Das Problem der k-Färbbarkeit ist ein gut untersuchtes Gebiet der Theoretischen Informatik. Im Vortrag wird ein Approximationsalgorithmus besprochen, der durch die Kombination von Semidefiniter Programmierung und rekursive Anwendung gute Ergebnisse erzielt. |
| Times: |
| part 1: Sunday 18th April 2004, 11.30 am, room 1/346 part 2: Wednesday 30th June 2004, 3.30 pm, room 1/B006 |
Chemnitz University of Technology receives a "StudyCheck Award 2024" and the "Top University 2024" certificate thanks to the very positive evaluations from its students and alumni – Additionally, Chemnitz University of Technology is the top state university in the live "Digital Readiness" ranking …
The 13th IEEE International Symposium on Computer Science and Educational Technology will take place from July 17th to 19th at the IBS Foundation in Lauta/Laubusch …
#TUCgether: Student Buddy Program of the International Office celebrated its 25th anniversary with a party …
17th edition of the IEEE International Symposium on Robotic and Sensors Environments will be held at Chemnitz University of Technology on 20-21 June, 2024 …
APMS 2024 - Advances in Production Management Systems - brings together leading experts to discuss …
The innoTRAC sees itself as a platform for the exchange of information between researchers, …
The International Workshop on Impedance Spectroscopy (IWIS) is a platform …
The 10th ELEC provides a platform for professors, teachers, trainers and …
New students are greeted each year at the beginning of the winter semester in a cherished …
Get with us in the mood of Christmas with our festive program for young and old alike.
