509 search results - page 69 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
116
Voted
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
118
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
118
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
127
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
157
Voted
ISBRA
2009
Springer
15 years 10 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...