676 search results - page 44 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
105
click to vote
WDAG
1990
Springer
15 years 6 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
116
click to vote
CGF
1998
15 years 1 months ago
1998
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
100
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
123
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
202
Voted
SDM
2012
SIAM
13 years 4 months ago
2012
SIAM
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...