7129 search results - page 222 / 1426 » Approximation Algorithms for Treewidth |
131
click to vote
LATIN
2000
Springer
15 years 7 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
146
click to vote
AAIM
2006
Springer
15 years 10 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
119
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
165
Voted
ESA
1999
Springer
15 years 8 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
141
click to vote
COCO
2007
Springer
15 years 7 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...