88 search results - page 4 / 18 » On Approximating Minimum Infrequent and Maximum Frequent Set... |
131
Voted
JAL
2006
15 years 1 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
121
click to vote
AI
1998
Springer
15 years 1 months ago
1998
Springer
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. ...
126
Voted
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
107
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
118
Voted
SIAMCOMP
2002
15 years 1 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...