3875 search results - page 99 / 775 » Approximation Algorithms for the Max-coloring Problem |
137
Voted
TAMC
2007
Springer
15 years 8 months ago
2007
Springer
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...
134
click to vote
COCOON
2010
Springer
15 years 6 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
158
Voted
MST
2010
14 years 9 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
121
Voted
ALGORITHMICA
1999
15 years 2 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
118
click to vote
SIAMSC
2010
15 years 27 days ago
2010
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...