500 search results - page 33 / 100 » Approximation algorithms for maximum independent set of pseu... |
117
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
100
click to vote
STOC
1995
ACM
15 years 5 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
We develop an iterative relaxation algorithm, called RIBRA, for NMR protein backbone assignment. RIBRA applies nearest neighbor and weighted maximum independent set algorithms to ...
127
click to vote
SIAMJO
2008
15 years 1 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....