324 search results - page 22 / 65 » Distance Approximating Trees: Complexity and Algorithms |
ICALP
2005
Springer
14 years 27 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
SODA
2007
ACM
13 years 8 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 ...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
BIODATAMINING
2008
13 years 7 months ago
2008
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
INFORMATICALT
2010
13 years 2 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...