2957 search results - page 114 / 592 » The Complexity of Polynomial-Time Approximation |
ICTCS
2005
Springer
14 years 3 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
DISOPT
2006
13 years 10 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
13 years 10 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...