Fixed-parameter tractability and data reduction for multicut in trees
type: Item
instance of: scholarly article
title: Fixed-parameter tractability and data reduction for multicut in trees
zbMATH Open document ID: 1081.68070
author: Jiong Guo
author: Rolf Niedermeier
published in: Networks
publication date: 2006-01-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 5000735
zbMATH Keywords: NP-hard problems
zbMATH Keywords: Multicut in Trees
zbMATH Keywords: exact algorithms
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: data reduction rules
zbMATH Keywords: problem kernel
MaRDI profile type: Publication
full work available at URL: net.20081
OpenAlex ID: W4243521820
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Algorithms and Data Structures
cites work: Mathematical Foundations of Computer Science 2004
cites work: On efficient fixed-parameter algorithms for weighted vertex cover
cites work: Q4414647
DOI: 10.1002/NET.20081
description: scientific article