2796 search results - page 185 / 560 » The coolest path problem |
190
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
196
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
181
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
180
click to vote
AAAI
2004
15 years 8 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
172
click to vote
CN
2004
15 years 6 months ago
2004
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...