1363 search results - page 123 / 273 » The road coloring problem |
226
click to vote
TCAD
2010
15 years 1 months ago
2010
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
158
click to vote
SIROCCO
2010
15 years 7 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
178
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
141
click to vote
AICT
2006
IEEE
16 years 12 days ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
158
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...