Thumbnail - Request a copy

On the approximation of some spanning-arborescence problems

Alfandari, Laurent; Paschos, Vangelis (1998), On the approximation of some spanning-arborescence problems, in Güdükbay, U.; Dayar, T.; Gürsoy, A.; Gelenbe, E., Advances in Computer and Information Science '98. Proceedings of the 13th International Symposium on Computer and Information Sciences, IOS Press : Amsterdam, p. 574-582

Type
Communication / Conférence
Date
1998
Conference title
ISCIS'98
Conference date
1998-10
Conference city
Ankara
Conference country
Turquie
Book title
Advances in Computer and Information Science '98. Proceedings of the 13th International Symposium on Computer and Information Sciences
Book author
Güdükbay, U.; Dayar, T.; Gürsoy, A.; Gelenbe, E.
Publisher
IOS Press
Published in
Amsterdam
ISBN
90-5199-405-2
Pages
574-582
Metadata
Show full item record
Author(s)
Alfandari, Laurent
Paschos, Vangelis
Subjects / Keywords
Polynomial-time approximation algorithms; master-slave game