Sciweavers

1554 search results - page 15 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
AAIM
2008
Springer
90views Algorithms» more  AAIM 2008»
14 years 4 months ago
Facility Location Problems: A Parameterized View
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
Michael R. Fellows, Henning Fernau
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 7 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
DAM
2006
136views more  DAM 2006»
13 years 9 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen
EVOW
2007
Springer
14 years 1 months ago
Dinucleotide Step Parameterization of Pre-miRNAs Using Multi-objective Evolutionary Algorithms
MicroRNAs (miRNAs) form a large functional family of small noncoding RNAs and play an important role as posttranscriptional regulators, by repressing the translation of mRNAs. Rece...
Jin-Wu Nam, In-Hee Lee, Kyu Baek Hwang, Seong-Bae ...
KSEM
2009
Springer
14 years 4 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...