Faster fixed-parameter tractable algorithms for matching and packing problems
type: Item
instance of: scholarly article
title: Faster fixed-parameter tractable algorithms for matching and packing problems
zbMATH Open document ID: 1170.68047
author: Dimitrios M. Thilikos
author: Michael R. Fellows
author: Christian Knauer
author: N. Nishimura
author: Prabhakar Ragde
author: Frances Rosamond
author: Ulrike Stege
author: Sue Whitesides
published in: Algorithmica
publication date: 2008-12-02T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5377140
zbMATH Keywords: parameterized complexity
zbMATH Keywords: fixed parameter tractable
zbMATH Keywords: graph matching
zbMATH Keywords: set packing
zbMATH Keywords: color coding
MaRDI profile type: Publication
Wikidata QID: Q57359876
full work available at URL: s00453-007-9146-y
OpenAlex ID: W2051064851
cites work: Color-coding
cites work: Structure preserving reductions among convex optimization problems
cites work: Q4474212
cites work: Q2934608
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Algorithms – ESA 2004
cites work: Storing a Sparse Table with 0 (1) Worst Case Access Time
cites work: An efficient parameterized algorithm for m-set packing
cites work: Divide-and-Color
cites work: A faster parameterized algorithm for set packing
cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
cites work: Parameterized complexity of constraint satisfaction problems
cites work: Q4414647
DOI: 10.1007/S00453-007-9146-Y
Recommended article: Algorithms – ESA 2004
Recommended article: Parameterized Algorithms for Weighted Matching and Packing Problems
Recommended article: Parameterized algorithms for weighted matching and packing problems
Recommended article: A faster parameterized algorithm for set packing
Recommended article: Faster and simpler approximation algorithms for mixed packing and covering problems
Recommended article: Parameterized approximation algorithms for packing problems
Recommended article: Faster Algebraic Algorithms for Path and Packing Problems
Recommended article: Improved Deterministic Algorithms for Weighted Matching and Packing Problems
Recommended article: Improved deterministic algorithms for weighted matching and packing problems
Recommended article: A fixed-parameter-tractable algorithm for set packing
description: scientific article; zbMATH DE number 5377140