37 search results - page 8 / 8 » Exact Closest String as a Constraint Satisfaction Problem |
CIAC
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
SODA
2010
ACM
13 years 2 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...