scientific article; zbMATH DE number 2044921

zbMATH Open1042.68621MaRDI QIDQ4448746FDOQ4448746

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (9)

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

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)