An improved algorithm for the red–blue hitting set problem with the consecutive ones property-Reference-Cited by-同舟云学术

An improved algorithm for the red–blue hitting set problem with the consecutive ones property

Published:2010-09 Issue:20 Volume:110 Page:845-848
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Chang Maw-Shang,Chung Hsiao-Han,Lin Chuang-Chieh

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference13 articles.

1. Structure preserving reductions among convex optimization problems;Ausiello;J. Comput. Syst. Sci.,1980

2. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms.;Booth;J. Comput. Syst. Sci.,1976

3. Design and validation of methods searching for risk factors in genotype case-control studies;Brinza;J. Comput. Biol.,2008

4. R.D. Carr, S. Doddi, G. Konjevod, M.V. Marathe, On the red–blue set cover problem, in: Proceedings of the 11th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA'00), San Francisco, California, pp. 345–353

5. Wavelength rerouting in optical networks, or the Venetian routing problem;Caprara;J. Algorithms,2002

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Red Blue Set Cover problem on axis-parallel hyperplanes and other objects;Information Processing Letters;2024-08

2. Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem;Frontiers of Algorithmic Wisdom;2022

3. A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property;Lecture Notes in Computer Science;2013

4. On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property;Lecture Notes in Computer Science;2012