2398 search results - page 329 / 480 » Constraint Programming and Graph Algorithms |
128
click to vote
STOC
1998
ACM
15 years 9 months ago
1998
ACM
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
168
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
159
click to vote
EUROCAST
2007
Springer
15 years 9 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
154
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
135
Voted
4OR
2006
15 years 5 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...