5595 search results - page 212 / 1119 » Approximation Algorithms for Clustering Problems |
156
click to vote
ICEC
1994
15 years 7 months ago
1994
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance ...
177
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
195
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
183
click to vote
CDC
2008
IEEE
16 years 23 days ago
2008
IEEE
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
176
click to vote
ALENEX
2009
15 years 7 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...