1632 search results - page 30 / 327 » Sublinear Time Algorithms for Metric Space Problems |
120
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
121
click to vote
AAAI
2008
15 years 5 months ago
2008
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
131
click to vote
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
120
click to vote
IEAAIE
2001
Springer
15 years 7 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
133
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...