Kernel(s) for problems with no kernel
type: Item
instance of: scholarly article
title: Kernel(s) for problems with no kernel
zbMATH Open document ID: 1295.68120
DOI: 10.1145/2344422.2344428
author: Daniel Binkele-Raible
author: Henning Fernau
author: Fedor V. Fomin
author: Daniel Lokshtanov
author: Saket Saurabh
author: Yngve Villanger
published in: ACM Transactions on Algorithms
publication date: 2014-09-09T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6341950
zbMATH Keywords: kernelization
zbMATH Keywords: lower bounds
zbMATH Keywords: max-leaf spanning tree
zbMATH Keywords: out-branching
zbMATH Keywords: parameterized algorithms
Wikidata QID: Q60488494
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/2344422.2344428
OpenAlex ID: W1999681430
DBLP publication ID: journals/talg/Binkele-RaibleFFLSV12
Recommended article: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
Recommended article: A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
Recommended article: A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem
Recommended article: Q5273088
Recommended article: Kernel Treelets
Recommended article: Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
Recommended article: Kernels and Grundy functions on trees
Recommended article: Approximate tree kernels
Recommended article: A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
description: scientific article