1215 search results - page 147 / 243 » Combinatorics |
137
click to vote
COCOON
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
132
Voted
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
Multiple reaction monitoring (MRM) is a mass spectrometric method to quantify a specified set of proteins. In this paper, we identify a problem at the core of MRM peptide quantific...
153
click to vote
COCOON
2004
Springer
15 years 7 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
140
Voted
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
122
Voted
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...