Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	September 2004
Genre:	Schulbücher
	algorithmanalysisandproblemcomplexity / Algorithmen und Datenstrukturen / algorithmics / Algorithms / algorithmsdesign / Algorithmus / angewandte informatik / complexity / complexityanalysis / complexitytheory / ComputationalComplexity / ComputationalDiscreteMathematics / datastructures / Datenbanken / Datenmanagement / Diskrete Mathematik / exactcomputation / graphalgorithms / Kombinatorik / Mathematik für Informatiker / parameterizedcomplexity / parameterizedcomputation / problemcomplexity / Proof / Resolution / Wahrscheinlichkeitsrechnung und Statistik mehr...
ISBN:	9783540230717
EAN-Code:	9783540230717
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#3162 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D 17 mm
Gewicht:	470 gr
Seiten:	308
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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.