scientific article; zbMATH DE number 2044921

MaRDI QIDQ4448746zbMATHFDO

Authors Jianer Chen, Iyad Kanj

Publication date 18 February 2004

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
• Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
• Publication:4941917
• Constrained bipartite vertex cover: the easy kernel is essentially tight
• An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs

Cited in

(9)

• Improved exact algorithms for MAX-SAT
• Constraint bipartite vertex cover: simpler exact algorithms and implementations
• On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
• Constrained bipartite vertex cover: the easy kernel is essentially tight
• An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
• Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
• Improved non-approximability results for minimum vertex cover with density constraints
• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
• Improved sparse covers for graphs excluding a fixed minor

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 Q4448746)