1158 search results - page 63 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
175
click to vote
FSTTCS
2003
Springer
15 years 10 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
158
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
177
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
152
click to vote
ALENEX
2008
15 years 6 months ago
2008
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
130
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...