1363 search results - page 66 / 273 » The road coloring problem |
AMI
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. High average intensity of traffic and problems like traffic congestions, road safety, etc. are challenging problems striking highway operators in these days. With the bro...
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
JCT
2007
14 years 9 months ago
2007
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
DAGSTUHL
2008
14 years 11 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
DAM
2007
14 years 9 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...