7129 search results - page 254 / 1426 » Approximation Algorithms for Treewidth |
142
Voted
COCO
2008
Springer
15 years 6 months ago
2008
Springer
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
146
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
124
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...
118
click to vote
RTSS
2002
IEEE
15 years 9 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
134
Voted
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...