4894 search results - page 150 / 979 » The Guarding Problem - Complexity and Approximation |
165
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
168
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
173
click to vote
EOR
2008
15 years 6 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
168
click to vote
JCSS
2006
15 years 6 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
149
click to vote
MP
2006
15 years 6 months ago
2006
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...