Back to Results
First PageMeta Content
NP-complete problems / Complexity classes / Analysis of algorithms / String / Closest string / Parameterized complexity / Kernelization / Time complexity / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics


Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz
Add to Reading List

Document Date: 2015-01-11 10:59:55


Open Document

File Size: 469,70 KB

Share Result on Facebook

Company

Vertex / /

Country

Germany / /

/

IndustryTerm

fixed-parameter algorithm / real-world applications / text mining / combinatorial algorithms / search trees / above-mentioned search tree approach / straightforward exhaustive search algorithm / direct combinatorial fixed-parameter algorithm / biological applications / motif search / randomized fixed-parameter algorithms / parameterized enumeration algorithms / approximate solutions / text processing / polynomialtime algorithms / combinatorial fixed-parameter algorithm / search tree strategy / problems using tools / /

OperatingSystem

Unix / /

Organization

NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz Rolf Niedermeier Institut für Softwaretechnik / Shared Center / Bonn / /

Person

Multiple Sequence / Christian Komusiewicz Rolf Niedermeier / /

Position

General / /

Technology

above-mentioned algorithms / fixed-parameter algorithm / Unix / time algorithm / direct combinatorial algorithms / straightforward exhaustive search algorithm / randomized fixed-parameter algorithms / direct combinatorial fixed-parameter algorithm / parameterized enumeration algorithms / combinatorial fixed-parameter algorithm / polynomialtime algorithms / /

SocialTag