Sciweavers

59 search results - page 1 / 12
» Red-blue covering problems and the consecutive ones property
Sort
View
JDA
2008
84views more  JDA 2008»
13 years 4 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
JCSS
2010
155views more  JCSS 2010»
13 years 3 months ago
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
Michael Dom, Jiong Guo, Rolf Niedermeier
CPM
2011
Springer
402views Combinatorics» more  CPM 2011»
12 years 8 months ago
Tractability Results for the Consecutive-Ones Property with Multiplicity
A binary matrix has the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1...
Cedric Chauve, Ján Manuch, Murray Patterson...
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
13 years 10 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
TAMC
2007
Springer
13 years 10 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier