60 search results - page 1 / 12 » Approximating a Finite Metric by a Small Number of Tree Metr... |
61
Voted
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
95
Voted
CCCG
2007
14 years 12 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
SIROCCO
2004
14 years 12 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
APPML
2002
14 years 10 months ago
2002
In phylogenetic analysis, a standard problem is to approximate a given metric by an additive metric. Here it is shown that, given a metric D defined on some finite set X and a non...
114
click to vote
WADS
2007
Springer
15 years 4 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...