Parameterized and exact computation : first international workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004 : proceedings / Rod Downey, Michael Fellows, Frank Dehne (eds.).

By: (1st : IWPEC (Workshop) (1st : 2004 : Bergen, Norway)
Contributor(s): Downey, R. G. (Rod G.) | Fellows, M. R. (Michael Ralph), 1952- | Dehne, F. (Frank), 1960-
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 3162.Publisher: Berlin ; New York : Springer, ©2004Description: 1 online resource (x, 290 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 354028639X; 9783540286394Other title: IWPEC 2004Subject(s): Parameter estimation -- Congresses | Computer algorithms -- Congresses | Computational complexity -- Congresses | Estimation d'un paramètre -- Congrès | Algorithmes -- Congrès | Complexité de calcul (Informatique) -- Congrès | MATHEMATICS -- Probability & Statistics -- General | Computational complexity | Computer algorithms | Parameter estimation | Berechnungskomplexität | Parametrisierung | Estimation d'un paramètre | Algorithme | Complexité algorithmique | Bergen (Norwegen, 2004)Genre/Form: Electronic books. | Conference papers and proceedings. | Kongress. Additional physical formats: Print version:: Parameterized and exact computation.DDC classification: 519.544 LOC classification: QA276.8 | .I96 2004ebOther classification: 54.71 | SS 4800 | DAT 517f Online resources: Click here to access online
Contents:
Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction -- Online Problems, Pathwidth, and Persistence -- Chordless Paths Through Three Vertices -- Computing Small Search Numbers in Linear Time -- Bounded Fixed-Parameter Tractability: The Case 2poly(k) -- Refined Memorisation for Vertex Cover -- Parameterized Graph Separation Problems -- Parameterized Coloring Problems on Chordal Graphs -- On Decidability of MSO Theories of Representable Matroids -- On Miniaturized Problems in Parameterized Complexity Theory -- Smaller Kernels for Hitting Set Problems of Constant Arity -- Packing Edge Disjoint Triangles: A Parameterized View -- Looking at the Stars -- Moving Policies in Cyclic Assembly-Line Scheduling -- A Structural View on Parameterizing Problems: Distance from Triviality -- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable -- Simplifying the Weft Hierarchy -- The Minimum Weight Triangulation Problem with Few Inner Points -- A Direct Algorithm for the Parameterized Face Cover Problem -- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets -- Parameterized Algorithms for Feedback Vertex Set -- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms -- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments -- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover -- Space and Time Complexity of Exact Algorithms: Some Open Problems -- Practical FPT Implementations and Applications.
Summary: This book constitutes the refereed proceedings of the First International Workshop on Parameterized and Exact Computation, IWPEC 2004, held in Bergen, Norway, in September 2004. The 25 revised full papers presented together with an invited paper were carefully reviewed and selected from 47 submissions. The topics addressed focus on all current issues in this new approach to designing algorithms.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

This book constitutes the refereed proceedings of the First International Workshop on Parameterized and Exact Computation, IWPEC 2004, held in Bergen, Norway, in September 2004. The 25 revised full papers presented together with an invited paper were carefully reviewed and selected from 47 submissions. The topics addressed focus on all current issues in this new approach to designing algorithms.

Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction -- Online Problems, Pathwidth, and Persistence -- Chordless Paths Through Three Vertices -- Computing Small Search Numbers in Linear Time -- Bounded Fixed-Parameter Tractability: The Case 2poly(k) -- Refined Memorisation for Vertex Cover -- Parameterized Graph Separation Problems -- Parameterized Coloring Problems on Chordal Graphs -- On Decidability of MSO Theories of Representable Matroids -- On Miniaturized Problems in Parameterized Complexity Theory -- Smaller Kernels for Hitting Set Problems of Constant Arity -- Packing Edge Disjoint Triangles: A Parameterized View -- Looking at the Stars -- Moving Policies in Cyclic Assembly-Line Scheduling -- A Structural View on Parameterizing Problems: Distance from Triviality -- Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable -- Simplifying the Weft Hierarchy -- The Minimum Weight Triangulation Problem with Few Inner Points -- A Direct Algorithm for the Parameterized Face Cover Problem -- On Finding Short Resolution Refutations and Small Unsatisfiable Subsets -- Parameterized Algorithms for Feedback Vertex Set -- Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms -- Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments -- Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover -- Space and Time Complexity of Exact Algorithms: Some Open Problems -- Practical FPT Implementations and Applications.

There are no comments for this item.

to post a comment.

Powered by Koha