Sciweavers

7129 search results - page 231 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CEC
2009
IEEE
16 years 1 months ago
The Pareto-Following Variation Operator as an alternative approximation model
— This paper presents a critical analysis of the Pareto-Following Variation Operator (PFVO) when used as an approximation method for Multiobjective Evolutionary Algorithms (MOEA)...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
TAMC
2007
Springer
16 years 21 days ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
16 years 21 days 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
SPIRE
2005
Springer
16 years 2 days ago
Restricted Transposition Invariant Approximate String Matching Under Edit Distance
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
Heikki Hyyrö
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron