753 search results - page 22 / 151 » Completing a (k - 1)-Assignment |
114
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
114
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
106
click to vote
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
ESA
2008
Springer
15 years 3 months ago
2008
Springer
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
CPC
2006
15 years 1 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...