453 search results - page 21 / 91 » On Approximation of Bookmark Assignments |
COCO
2008
Springer
13 years 9 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...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
IPL
2006
13 years 7 months ago
2006
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
SODA
1997
ACM
13 years 9 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
JMLR
2006
13 years 7 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...