4131 search results - page 183 / 827 » The Generalized Max-Controlled Set Problem |
169
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
115
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
A very common type of a-priori knowledge in pattern analysis problems is invariance of the input data with respect to transformation groups, e.g. geometric transformations of imag...
164
Voted
SIAMCOMP
1998
15 years 3 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...
197
Voted
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
141
Voted
MP
2010
14 years 10 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...