Red-blue covering problems and the consecutive ones property
From MaRDI portal
(Redirected from Publication:1018089)
Recommendations
- Publication:4952637
- Set covering with almost consecutive ones property
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property
- Minimum Membership Set Covering and the Consecutive Ones Property
- On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property
Cites work
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1445322 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 3185974 (Why is no real title available?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A new polynomial-time algorithm for linear programming
- A structure theorem for the consecutive 1's property
- A threshold of ln n for approximating set cover
- Algorithms for the set covering problem
- Algorithms – ESA 2004
- Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Computing and Combinatorics
- Introduction to algorithms
- On the consecutive ones property
- Optimal Capacity Scheduling—I
- Optimization, approximation, and complexity classes
- Orthogonal segment stabbing
- PC trees and circular-ones arrangements.
- Parametrized complexity theory.
- Set covering with almost consecutive ones property
- Station location -- complexity and approximation
- Structure preserving reductions among convex optimization problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The consecutive ones submatrix problem for sparse matrices
- Wavelength rerouting in optical networks, or the Venetian Routing problem
Cited in
(12)- Exact algorithms and hardness results for geometric red-blue hitting set problem
- Set covering with almost consecutive ones property
- Red blue set cover problem on axis-parallel hyperplanes and other objects
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property
- On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property
- Geometric red-blue set cover for unit squares and related problems
- Algorithms – ESA 2004
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- Minimum Membership Set Covering and the Consecutive Ones Property
- The bus rapid transit investment problem
- scientific article; zbMATH DE number 1445322 (Why is no real title available?)
- Minimum membership covering and hitting
This page was built for publication: Red-blue covering problems and the consecutive ones property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018089)
