676 search results - page 39 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
129
click to vote
RTSS
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
102
click to vote
SODA
2007
ACM
15 years 3 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
126
click to vote
JCO
2008
15 years 1 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
116
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...