Sciweavers

5595 search results - page 81 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SAC
2005
ACM
15 years 10 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
IJCNN
2000
IEEE
15 years 9 months ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
15 years 11 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
15 years 10 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
FCT
2003
Springer
15 years 10 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith