Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/35960
Title: Query-competitive algorithms for cheapest set problems under uncertainty
Authors: Erlebach, Thomas R.
Hoffmann, Michael
Kammer, Frank
First Published: 2016
Publisher: Elsevier
Citation: Theoretical Computer Science, in press
ISSN: 0304-3975
Links: http://hdl.handle.net/2381/35960
Embargo on file until: 1-Jan-10000
Version: Post-print
Status: Peer-reviewed
Type: Journal Article
Rights: Copyright © YEAR, Elsevier. Deposited with reference to the publisher’s archiving policy available on the SHERPA/RoMEO website.
Description: This file is under embargo for 18 months from first date of publication.
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
main.pdfPost-review (final submitted)368.76 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.