1158 search results - page 85 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
179
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
173
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
210
click to vote
EDBT
2011
ACM
14 years 9 months ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
175
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
162
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...