Vai al contenuto principale della pagina
Titolo: |
Parameterized and exact computation : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / Jianer Chen, Fedor V. Fomin (Eds.)
![]() |
Pubblicazione: | Berlin ; ; Heidelberg, : Springer-Verlag, c2009 |
Edizione: | 1st ed. 2009. |
Descrizione fisica: | 1 online resource (X, 335 p. 26 illus.) |
Disciplina: | 519.544 |
Soggetto topico: | Parameter estimation |
Computer algorithms | |
Computational intelligence | |
Machine learning | |
Classificazione: | 004 |
DAT 517f | |
SS 4800 | |
Altri autori: |
ChenJianer
![]() ![]() |
Note generali: | Includes index. |
Nota di contenuto: | Balanced Hashing, Color Coding and Approximate Counting -- Kernelization: New Upper and Lower Bound Techniques -- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams -- Planar Capacitated Dominating Set Is W[1]-Hard -- Boolean-Width of Graphs -- The Complexity of Satisfiability of Small Depth Circuits -- On Finding Directed Trees with Many Leaves -- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms -- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover -- What Makes Equitable Connected Partition Easy -- Improved Induced Matchings in Sparse Graphs -- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs -- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem -- An Exponential Time 2-Approximation Algorithm for Bandwidth -- On Digraph Width Measures in Parameterized Algorithmics -- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms -- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs -- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds -- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor -- Partitioning into Sets of Bounded Cardinality -- Two Edge Modification Problems without Polynomial Kernels -- On the Directed Degree-Preserving Spanning Tree Problem -- Even Faster Algorithm for Set Splitting! -- Stable Assignment with Couples: Parameterized Complexity and Local Search -- Improved Parameterized Algorithms for the Kemeny Aggregation Problem -- Computing Pathwidth Faster Than 2 n . |
Titolo autorizzato: | Parameterized and exact computation ![]() |
ISBN: | 3-642-11269-2 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910484324703321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |