Problems on Graphs
This chapter deals with a large class of computational problems, namely graph problems.
- PDF / 3,429,889 Bytes
- 360 Pages / 453.543 x 683.15 pts Page_size
- 23 Downloads / 219 Views
Dennis Komm
An Introduction to Online Computation Determinism, Randomization, Advice
Texts in Theoretical Computer Science. An EATCS Series Series editors Monika Henzinger, Faculty of Science, Universität Wien, Vienna, Austria Juraj Hromkovič, Department of Computer Science, ETH Zürich, Zürich, Switzerland Mogens Nielsen, Department of Computer Science, Aarhus Universitet, Denmark Grzegorz Rozenberg, Leiden Center of Advanced Computer Science, Leiden, The Netherlands Arto Salomaa, Turku Centre of Computer Science, Turku, Finland
More information about this series at http://www.springer.com/series/3214
Dennis Komm
An Introduction to Online Computation Determinism, Randomization, Advice
123
Dennis Komm Department of Computer Science ETH Zürich Zürich Switzerland
ISSN 1862-4499 Texts in Theoretical Computer Science. An EATCS Series ISBN 978-3-319-42747-8 ISBN 978-3-319-42749-2 DOI 10.1007/978-3-319-42749-2
(eBook)
Library of Congress Control Number: 2016955071 © Springer International Publishing Switzerland 2016 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper This Springer imprint is published by Springer Nature The registered company is Springer International Publishing AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
My parents, my brothers, my love.
Preface
The design and analysis of algorithms deals with extracting certain information from instances of computational problems. In a way, this information is “hidden” in the instances, and usually the aim is to come up with a clever way to obtain the desired information with as little effort (for instance, using as little space and time) as possible. In online computation, we are facing a situation that somewhat diverges from this setting. Here, the instance is not known in advance, but we gradually get to know it piece by piece over time. However, parts of the final output must already be created before the whole input is known. As an example, consider t
Data Loading...
