1158 search results - page 99 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
154
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
223
click to vote
WEA
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
143
Voted
SODA
2008
ACM
15 years 7 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
171
click to vote
CATS
2006
15 years 7 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
159
Voted
GECCO
2007
Springer
16 years 9 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...