scientific article; zbMATH DE number 2080245

MaRDI QIDQ4472490zbMATH OpenFDO

Authors Rolf Niedermeier, Peter Rossmanith

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690180.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• On efficient fixed-parameter algorithms for weighted vertex cover
• An improved fixed-parameter algorithm for vertex cover
• Parameterized complexity of Vertex Cover variants
• Algorithms and Data Structures
• A multivariate approach for weighted FPT algorithms

Cited in

(13)

• Graph separators: A parameterized view
• Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem
• A multivariate framework for weighted FPT algorithms
• Parameterized complexity of Vertex Cover variants
• Crown reductions for the minimum weighted vertex cover problem
• A multivariate approach for weighted FPT algorithms
• On efficient fixed-parameter algorithms for weighted vertex cover
• scientific article; zbMATH DE number 1979504 (Why is no real title available?)
• Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
• On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
• Algorithms and Data Structures
• On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
• Parameterized approximation algorithms for weighted vertex cover

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472490)