Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

YAEM 2010
YÖNEYLEM ARAÞTIRMASI VE ENDÜSTRÝ MÜHENDÝSLÝGI 30. ULUSAL KONGRESÝ
We assume that we are given a set of p possible traffic patterns, and
our objective is to place the minimum number of regenerators at the
nodes so that each of the traffic patterns is satisfied. We prove that
for any fixed d, p > 1 it does not accept a PTAS, even if the lightpaths
have bounded length. We provide a constant-factor approximation
algorithm with ratio log (d. p). We study the case where G is a path,
proving that the problem is NP-hard for any d, p > 1.
1195