19 search results - page 2 / 4 » Applying Scheduling by Edge Reversal to Constraint Partition... |
DISOPT
2007
13 years 5 months ago
2007
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
FOCS
2000
IEEE
13 years 8 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
SIAMCOMP
1998
13 years 4 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
SDM
2008
SIAM
13 years 6 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...