1554 search results - page 34 / 311 » Parameterized Complexity and Approximation Algorithms |
113
click to vote
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
74
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
15 years 3 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
ISAAC
2001
Springer
15 years 2 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
81
Voted
CASC
2009
Springer
15 years 4 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...