• search hit 12 of 16
Back to Result List

On the advice complexity of the set cover problem

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Dennis Komm, Richard Královič, Tobias MömkeORCiDGND
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/83548
ISBN:9783642306419OPAC
ISBN:9783642306426OPAC
ISSN:0302-9743OPAC
ISSN:1611-3349OPAC
Parent Title (English):Lecture Notes in Computer Science
Publisher:Springer
Place of publication:Berlin
Type:Article
Language:English
Year of first Publication:2012
Publishing Institution:Universität Augsburg
Release Date:2021/02/16
Volume:7353
First Page:241
Last Page:252
Note:
Published in: Computer Science – Theory and Applications: 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings. Editors: Edward A. Hirsch, Juhani Karhumäki, Arto Lepistö, Michail Prilutskii
DOI:https://doi.org/10.1007/978-3-642-30642-6_23
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Theoretische Informatik / Resource Aware Algorithmics