1933 search results - page 79 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
129
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
135
click to vote
APIN
2005
15 years 3 months ago
2005
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
136
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
150
Voted
JCSS
2002
15 years 3 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
128
Voted
JAIR
2007
15 years 3 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...