On the red-blue set cover problem

Authors:
Robert D. Carr;Srinivas Doddi;Goran Konjevod;Madhav Marathe
Affiliations:
Sandia National Labs, Albuquerque, NM and Multiprogram Laboratory, Lockheed Martin Company;Los Alamos National Laboratory, P.O. Box 1663, MS B265, Los Alamos, NM;Dept. of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA;Los Alamos National Laboratory, P.O. Box 1663, MS B265, Los Alamos, NM
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 9
Cited 30

How to use expert advice

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Hardness of approximations

Approximation algorithms for NP-hard problems
Using and combining predictors that specialize

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the minimum label spanning tree problem

Information Processing Letters
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

SIAM Journal on Computing
Design networks with bounded pairwise distance

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for directed Steiner problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Intractability of Assembly Sequencing: Unit Disks in the Plane

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures

(1 + &egr;&Bgr;)-spanner constructions for general graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Strong Inapproximability of the Basic k-Spanner Problem

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Wavelength rerouting in optical networks, or the Venetian routing problem

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Wavelength rerouting in optical networks, or the Venetian Routing problem

Journal of Algorithms
The labeled perfect matching in bipartite graphs

Information Processing Letters
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems

Journal of Discrete Algorithms
Red-blue covering problems and the consecutive ones property

Journal of Discrete Algorithms
Topical query decomposition

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
On the Positive--Negative Partial Set Cover problem

Information Processing Letters
The labeled maximum matching problem

Computers and Operations Research
Frugal Routing on Wireless Ad-Hoc Networks

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Optimising topical query decomposition

Proceedings of the 2009 workshop on Web Search Click Data
Reliable routings in networks with generalized link failure events

IEEE/ACM Transactions on Networking (TON)
Approximation and Hardness Results for Label Cut and Related Problems

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Genotype Tagging with Limited Overfitting

BSB '09 Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
The labeled perfect matching in bipartite graphs

Information Processing Letters
Synthesizing view definitions from data

Proceedings of the 13th International Conference on Database Theory
An improved algorithm for the red-blue hitting set problem with the consecutive ones property

Information Processing Letters
The parameterized complexity of some minimum label problems

Journal of Computer and System Sciences
Output URL bidding

Proceedings of the VLDB Endowment
Approximation and hardness results for label cut and related problems

Journal of Combinatorial Optimization
Reliable routings in networks with generalized link failure events

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
On complexity and approximability of the labeled maximum/perfect matching problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms and hardness results for labeled connectivity problems

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Algorithms for failure protection in large IP-over-fiber and wireless ad hoc networks

Dependable Systems
Covering analysis of the greedy algorithm for partial cover

Algorithms and Applications
Mining contextual preference rules for building user profiles

DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
Comparison of heuristics for the colourful travelling salesman problem

International Journal of Metaheuristics
Mining Minimal Motif Pair Sets Maximally Covering Interactions in a Protein-Protein Interaction Network

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

On the red-blue set cover problem

Quantified Score

Visualization

Abstract