Optimization Problems, Approximation Schemes, and Their Relation to FPT
We begin to analyze the relationship between classical optimization problems and parameterized complexity. We explore syntactically defined classes of optimization problems that capture some of the main issues.
- PDF / 7,883,809 Bytes
- 765 Pages / 441 x 666 pts Page_size
- 75 Downloads / 214 Views
Rodney G. Downey Michael R. Fellows
Fundamentals of Parameterized Complexity
Texts in Computer Science Editors David Gries Fred B. Schneider
For further volumes: www.springer.com/series/3191
Rodney G. Downey r Michael R. Fellows
Fundamentals of Parameterized Complexity
Rodney G. Downey School of Mathematics, Statistics and Operations Research Victoria University Wellington, New Zealand
Michael R. Fellows School of Engineering and Information Technology Charles Darwin University Darwin, Northern Territory, Australia
Series Editors David Gries Department of Computer Science Cornell University Ithaca, NY, USA
Fred B. Schneider Department of Computer Science Cornell University Ithaca, NY, USA
ISSN 1868-0941 ISSN 1868-095X (electronic) Texts in Computer Science ISBN 978-1-4471-5558-4 ISBN 978-1-4471-5559-1 (eBook) DOI 10.1007/978-1-4471-5559-1 Springer London Heidelberg New York Dordrecht Library of Congress Control Number: 2013955593 © Springer-Verlag London 2013 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. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law. 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. While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Downey dedicates this book to his wife Kristin, and Fellows to his wife Frances.
Preface
Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern algorithm design and analysis, with a broad range of theoretical
Data Loading...
