Sciweavers

2698 search results - page 96 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
16 years 11 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
JOIN
2007
91views more  JOIN 2007»
15 years 6 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
ICASSP
2008
IEEE
16 years 22 days ago
Modeling regulatory sites with higher order position-dependent weight matrices
Identification of regulatory signals in DNA depends on the nature and quality of the patterns of representative sequences. These patterns are constructed from training sets of se...
Hossein Zare, Mostafa Kaveh, Arkady B. Khodursky
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
15 years 11 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar