On the approximability and hardness of minimum topic...

Theoretical Computer Science 2012 Vol. 429; Iss. none

On the approximability and hardness of minimum topic connected overlay and its special instances

Jun Hosoda, Juraj Hromkovič, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
429
Year:
2012
Language:
english
Pages:
11
DOI:
10.1016/j.tcs.2011.12.033
File:
PDF, 254 KB
english, 2012
Conversion to is in progress
Conversion to is failed