AbstractThis paper extends previous results of the authors. In particular, non-treerealizable metrics are investigated and it is shown that every finite metric has an optimal realization by a graph
FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOGiven a finite directed graph G with n ...
We present a constant-factor approximation algorithm for computing an embedding of the shortest path...
AbstractLet D be a distance matrix. We use heuristics for finding the largest tree that realizes a s...
AbstractThis paper extends previous results of the authors. In particular, non-treerealizable metric...
Finite metric spaces are an essential tool in discrete mathematics and have applications in several ...
This PhD thesis, consisting of an introduction, four papers, and some supplementary results, studies...
AbstractThe algorithm we present is a natural next step to well-known algorithms for finding optimal...
Abstract. A realisation of a metric d on a finite set X is a weighted graph (G,w) whose vertex set c...
We consider the embedding of a finite metric space into a weighted graph in such a way that the tota...
An optimal realization of a metric d on a set X is a weighted graph G = (V, E, w) such that X ⊆ V, d...
Abstract. One of the main problems in phylogenetics is to find good approximations of metrics by wei...
3 Further, we will also give an alternative proof for lower bounding the distortion when probabilist...
We study low-distortion embedding of metric spaces into the line, and more generally, into the short...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
The METRIC EMBEDDING problem takes as input two metric spaces (X,DX) and (Y,DY), and a positive inte...
FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOGiven a finite directed graph G with n ...
We present a constant-factor approximation algorithm for computing an embedding of the shortest path...
AbstractLet D be a distance matrix. We use heuristics for finding the largest tree that realizes a s...
AbstractThis paper extends previous results of the authors. In particular, non-treerealizable metric...
Finite metric spaces are an essential tool in discrete mathematics and have applications in several ...
This PhD thesis, consisting of an introduction, four papers, and some supplementary results, studies...
AbstractThe algorithm we present is a natural next step to well-known algorithms for finding optimal...
Abstract. A realisation of a metric d on a finite set X is a weighted graph (G,w) whose vertex set c...
We consider the embedding of a finite metric space into a weighted graph in such a way that the tota...
An optimal realization of a metric d on a set X is a weighted graph G = (V, E, w) such that X ⊆ V, d...
Abstract. One of the main problems in phylogenetics is to find good approximations of metrics by wei...
3 Further, we will also give an alternative proof for lower bounding the distortion when probabilist...
We study low-distortion embedding of metric spaces into the line, and more generally, into the short...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
The METRIC EMBEDDING problem takes as input two metric spaces (X,DX) and (Y,DY), and a positive inte...
FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOGiven a finite directed graph G with n ...
We present a constant-factor approximation algorithm for computing an embedding of the shortest path...
AbstractLet D be a distance matrix. We use heuristics for finding the largest tree that realizes a s...
DOI
Add to ORKG