503 search results - page 34 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
142
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Online reputation mechanisms need honest feedback to function effectively. Self interested agents report the truth only when explicit rewards offset the cost of reporting and th...
125
click to vote
EOR
2008
15 years 3 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
159
Voted
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
127
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
103
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...