Coverart for item
The Resource Parameterized and exact computation : 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings, Venkatesh Raman, Saket Saurabh (eds.)

Parameterized and exact computation : 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings, Venkatesh Raman, Saket Saurabh (eds.)

Label
Parameterized and exact computation : 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings
Title
Parameterized and exact computation
Title remainder
5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings
Statement of responsibility
Venkatesh Raman, Saket Saurabh (eds.)
Title variation
IPEC 2010
Creator
Contributor
Subject
Genre
Language
eng
Summary
Annotation
Member of
Cataloging source
GW5XE
Dewey number
511.352
Illustrations
illustrations
Index
index present
LC call number
  • QA267.8
  • QA276.8
LC item number
.I96 2010
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2010
http://bibfra.me/vocab/lite/meetingName
IPEC (Symposium)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1962-
http://library.link/vocab/relatedWorkOrContributorName
  • Raman, V.
  • Saurabh, Saket
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
6478
http://library.link/vocab/subjectName
  • Parameter estimation
  • Computer algorithms
  • Computational complexity
  • Computer algorithms
  • Computational complexity
  • Berechnungskomplexität
  • Parametrisierte Komplexität
  • Kongress
  • Parameter estimation
  • Chennai <2010>
  • Informatique
  • Computational complexity
  • Computer algorithms
  • Parameter estimation
  • Berechnungskomplexität
  • Parametrisierte Komplexität
  • Chennai <2010>
Summary expansion
This book constitutes the refereed best selected papers of the 5th International Symposium on Parameterized and Exact Computation, IPEC 2010, held in Chennai, India, in December 2010. The 19 revised full papers presented were carefully reviewed and selected from 32 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; implementation issues of parameterized and exact algorithms; fixed-parameter approximation; fast approximation in exponential time; kernelization lower and upper bounds
Label
Parameterized and exact computation : 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings, Venkatesh Raman, Saket Saurabh (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
The Complexity of Satisfaction on Sparse Graphs -- Protrusions in Graphs and Their Applications -- Parameterized Complexity Results in Symmetry Breaking -- On the Kernelization Complexity of Colorful Motifs -- Partial Kernelization for Rank Aggregation: Theory and Experiments -- Enumerate and Measure: Improving Parameter Budget Management -- On the Exact Complexity of Evaluating Quantified k-CNF -- Cluster Editing: Kernelization Based on Edge Cuts -- Computing the Deficiency of Housing Markets with Duplicate Houses -- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application -- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion -- Multivariate Complexity Analysis of Swap Bribery -- Parameterizing by the Number of Numbers -- Are There Any Good Digraph Width Measures? -- On the (Non- )existence of Polynomial Kernels for P l -free Edge Modification Problems -- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming -- On the Grundy Number of a Graph -- Exponential Time Complexity of Weighted Counting of Independent Sets -- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected -- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting -- Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier -- Proper Interval Vertex Deletion
Control code
697300455
Dimensions
unknown
Extent
1 online resource (x, 238 pages)
Form of item
online
Isbn
9783642174933
Lccn
2010939810
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-17493-3
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-17492-6
Specific material designation
remote
System control number
(OCoLC)697300455
Label
Parameterized and exact computation : 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings, Venkatesh Raman, Saket Saurabh (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
The Complexity of Satisfaction on Sparse Graphs -- Protrusions in Graphs and Their Applications -- Parameterized Complexity Results in Symmetry Breaking -- On the Kernelization Complexity of Colorful Motifs -- Partial Kernelization for Rank Aggregation: Theory and Experiments -- Enumerate and Measure: Improving Parameter Budget Management -- On the Exact Complexity of Evaluating Quantified k-CNF -- Cluster Editing: Kernelization Based on Edge Cuts -- Computing the Deficiency of Housing Markets with Duplicate Houses -- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application -- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion -- Multivariate Complexity Analysis of Swap Bribery -- Parameterizing by the Number of Numbers -- Are There Any Good Digraph Width Measures? -- On the (Non- )existence of Polynomial Kernels for P l -free Edge Modification Problems -- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming -- On the Grundy Number of a Graph -- Exponential Time Complexity of Weighted Counting of Independent Sets -- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected -- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting -- Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier -- Proper Interval Vertex Deletion
Control code
697300455
Dimensions
unknown
Extent
1 online resource (x, 238 pages)
Form of item
online
Isbn
9783642174933
Lccn
2010939810
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-17493-3
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-17492-6
Specific material designation
remote
System control number
(OCoLC)697300455

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...