Jump to ContentJump to Main Navigation
Invitation to Fixed-Parameter Algorithms$
Users without a subscription are not able to see the full content.

Rolf Niedermeier

Print publication date: 2006

Print ISBN-13: 9780198566076

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198566076.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 19 May 2019

CONNECTIONS TO APPROXIMATION ALGORITHMS

CONNECTIONS TO APPROXIMATION ALGORITHMS

Chapter:
(p.237) 14 CONNECTIONS TO APPROXIMATION ALGORITHMS
Source:
Invitation to Fixed-Parameter Algorithms
Author(s):

Rolf Niedermeier

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198566076.003.0014

This chapter summarizes the currently known connections between fixed-parameter and polynomial-time approximation algorithmics. Important topics in this context are lower bound and impossibility results. In particular, polynomial-time approximation schemes are discussed in some detail, providing a link with parameterized complexity theory.

Keywords:   fixed-parameter, polynomial-time approximation, lower bound, complexity theory

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .