Sciweavers

24 search results - page 3 / 5
» Bounded fixed-parameter tractability and reducibility
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 7 months ago
Approximability and parameterized complexity of minmax values
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen,...
JC
2008
128views more  JC 2008»
13 years 7 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
TCBB
2010
144views more  TCBB 2010»
13 years 2 months ago
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
Guillaume Blin, Florian Sikora, Stéphane Vi...
EJC
2008
13 years 7 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 5 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...