7930 search results - page 110 / 1586 » Greedy in Approximation Algorithms |
169
click to vote
QSIC
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
157
click to vote
MP
1998
15 years 6 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
219
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
274
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
146
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...