Fakultät Informatik Wiki

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.

===== Beispiel für Oberseminare =====
[[organisation_eines_kolloquiums_oder_oberseminars|zurück]]

  +**********************************************************************
  *
  *
  *                          Einladung
  *
  *
  *
  *                     Informatik-Oberseminar
  *
  *
  *
  +**********************************************************************
  
  Zeit:  Freitag, 6. September 2002, 11.00 Uhr
  Ort:   AH IV, Ahornstr. 55
  
  Referent: Max Mustermann M.Sc.
            Lehrstuhl Informatik 42
  
  Thema: Hardness results and approximation algorithms of k-tuple domination
         in graphs
  
  Abstract:
  
  In this talk, we study hardness results and approximation algorithms of
  k-tuple domination in graphs. The k-tuple domination problem is a
  generalization of the dominating set problem in graphs in which each
  vertex of the graph h as to be dominated at least k times (instead of just
  once).
  
  
  Es laden ein: die Dozentinnen und Dozenten der Informatik